Project Euler is a website - projecteuler.net - dedicated to a series of computational problems intended to be solved with computer programs. Problems are of varying difficulty, but each is solvable in less than a minute of CPU time using an efficient algorithm on a modestly powered computer.

- [r] Project Euler Problem 17 - Number Letter Counts - solved with R
- [js] Project Euler Problem 16 - Power Digit Sum - solved with Javascript
- [r] Project Euler Problem 15 - Lattice Paths - solved with R
- [r] Finding the 10001st prime with R
- [js] Find longest Collatz sequence using Javascript
- [kotlin] Sum large numbers with Kotlin versus Javascript
- [kotlin] Find Highly Divisible Triangular Numbers with Kotlin
- [rust] Find the Largest Product in a Grid with Rust
- [rust] Summation of the First Two Million Primes with Rust
- [rust] Finding the largest product in a series with Rust
- [rust] Finding the 10001st prime with Rust
- [rust] Project Euler number six solved with Rust
- [rust] Smallest positive number that is evenly divisible by all of the numbers from 1 to 20 with Rust
- [rust] Finding the largest palindrome product with Rust
- [reason] Get the largest prime factor with Reason
- [ocaml] Find the sum of all even Fibonacci numbers below four million with OCaml
- [ocaml] Finding the sum of all multiples of 3 or 5 below 1000 with OCaml
- [reason] Special Pythagorean Triplet solved with Reason