Click on one of the examples to load and freely edit the code for it in the editor.
Compute the GCD of two numbers using Euclid's algorithm
Sieve of Eratosthenes is a simple, ancient algorithm for finding all prime numbers up to any given limit.
Joining the ranks of 600 other programming languages by programmatically generating this popular folk song.
Play with immutable maps and the rich standard library functions.
Go ahead - press the run button.