My Project Euler page
Project Euler contains a large number of problems of various difficulty:
Project Euler is a series of challenging mathematical/computer programming problems that will require more than just mathematical insights to solve. Although mathematics will help you arrive at elegant and efficient methods, the use of a computer and programming skills will be required to solve most problems.
The motivation for starting Project Euler, and its continuation, is to provide a platform for the inquiring mind to delve into unfamiliar areas and learn new concepts in a fun and recreational context.
When I learn a new programming language, one of the first tasks is to implement at least the first 10 Project Euler problems (they are quite easy) and often alse the next 40. Here is a list of my implementations (search for "Euler" in the linked pages). Many of these languages are very highlevel which makes it's even easier to solve the tasks, especially if they support arbitrary precision. The number indicates the problems implemented.
- APL (1..10)
- B-Prolog (1..11)
- Curry (1..50)
- ECLiPSe CLP (1..10,12..17,19..22,24,25,28,31,32,34,36)
- Elixir (1..50)
- Frink (1..50)
- Haskell (1..50)
- J (1..13)
- Java (1..50)
- JavaSscript (1..50)
- Julia (1..50)
- Kona/K The entries are from Kona's Project Euler Gode Golf page. (I'm
hakank, and not the implementor of the shortest programs for the 10 first problems.)
- Mathematica (1..50)
- Perl6 (old version) (1..19 - some)
- Picat (1..50)
- Poplog/Pop-11 (1..50)
- Python2.7 (1..50)
- Racket (1..50)
- SETL (1..50)
- SetlX (1..50)
- SICStus Prolog (1..50)
- SWI-Prolog (1..50)
- Icon/Unicon (1..50)
The ultimate goal is to run all the first 50 problems in total under 10s, but I tend to be satisfied if they run under 1 min in total, or at least less than 10s per problem.
Note that for some programming languages I've done much more tweaking than for other.
Here are the run times for programming languages for which all 1..50 problems are implemented. They are ran on a Linux Ubuntu 18.05LTS, Intel i9-7940X CPU @ 3.10GHz 64Gb RAM). The first value is the total of the measured time of the function (also reports the total time to running everything with a wrapper):
- Curry (best times of PAKCS, PAKCS CLP, and KiCS2): 1min56.8s
- Haskell (compiled): 27.1s
- Elixir: 52.8s
- Frink: 56.36s (total with Frink wrapper: 57.4s)
- Icon/Unicon: 35.3s (total with Perl wrapper: 35.8s)
- Java: 3.52s (total with Java wrapper: 3.97s + 1.0s compile time)
- JavaScript: 1.89s (total with node wrapper: 4.8s, total with Perl wrapper: 4.7s)
- Julia: 0.87s (total time with a Julia wrapper: 4.06s)
- Mathematica: 1min43s
- Poplog/Pop11: 9.2s (total with Perl wrapper: 11.0s)
- Picat: 3.99s (total with Picat wrapper: 4.75s, total with Perl wrapper: 6.5s)
- Python 7.21s (total with Python 2.7 wrapper w/o or-tools): 7.05s
- using Google or-tools/python for problems 9, 32, and 43 (Python 3): 5.1s
- using pypy (no or-tool supported): 1.85 (total with PyPy wrapper:3.37s
- Python 3.7 plain w/o or-tools: 5.4s (total with Python wrapper: 5.7s)
- Racket: 2.7s (with Perl wrapper: 4.1s) (with Racket wrapper: 4.1s)
- SETL: 1 min 28.74s (with Perl wrapper: same)
- SetlX: 1 min 07.15s (with Perl wrapper: same)
- SICStus Prolog: 13.2s (total with Perl wrapper: same)
- SWI-Prolog: 1 min 23.2s (total with Perl wrapper: same)
Back to my main homepage