The table of contents was limited to the first 1000 articles out of 1992 total. Click here to view all children of Knowledge olympiad by domain of knowledge.
Saw this one mentioned on some Project Euler forum threads.
To be fair, this is one of the least worse ones.
Their system is quite good actually. Not as good as a GitHub repo with all the tests made explicit. But still pretty good.
They don't have an actual online judge system, all problems simply have a single small string solution, almost always integer or fixed precision floating point, and they just check that you've found the value.
The only metric that matters is who solved the problem first after publication. This is visible e.g. at: projecteuler.net/fastest=454 but only for logged in users... Lol it is ridiculous. The "language" in which problems were solved is just whatever the user put in their profile, they can't actually confirm that.
Problems are under CC BY-NC-SA: projecteuler.net/copyright
Once you solve a problem, you can then access its "private" forum thread: projecteuler.net/thread=950 and people will post a bunch of code solutions in there.
How problems are chosen:
projecteuler.net says it started as a subsection in mathschallenge.net, and in 2006 moved to its own domain. WhoisXMLAPI WHOIS history says it was registered by domainmonster.com but details are anonymous. TODO: sample problem on mathschallenge.net on Wayback Machine? Likely wouldn't reveal much anyways though as there is no attribution to problem authors on that site.
www.hackerrank.com/contests/projecteuler/challenges holds challenges with an actual judge and sometimes multiple test cases so just printing the final solution number is not enough.
Project Euler problems typically involve finding or proving and then using a lemma that makes computation of the solution feasible without brute force. There is often an obvious brute force approach, but the pick problem sizes large enough such that it is just not fast enough, but the non-brute-force is.
news.ycombinator.com/item?id=7057408 which is mega high on Google says:
I love project euler, but I've come to the realization that its purpose is to beat programmers soundly about the head and neck with a big math stick. At work last week, we were working on project euler at lunch, and had the one CS PhD in our midst not jumped up and explained the chinese remainder theorem to us, we wouldn't have had a chance.
In many cases, the efficient solution involves dynamic programming.
There are also a set of problems which are very numerical analysis in nature and require the approximation of some real number to a given precision. These are often very fiddly as I doubt most people can prove that their chosen hyperparameters guarantee the required precision.
Many problems ask for solution modulo some number. In general, this is only so that C/C++ users won't have to resort to using an arbitrary-precision arithmetic library and be able to fit everything into
uint64 instead. Maybe it also helps the judge system slightly having smaller strings to compare. The final modulos usually don't add any insight to the problems.Bibliography:
Repositories of numerical solutions:
Repositories of code solutions:
- euler.stephan-brumme.com/ large number of solutions in C++, stopped around 600. Informal permissive license, e.g. at: euler.stephan-brumme.com/243/Asked for a more formal open license at: github.com/stbrumme/euler/issues/7All of my solutions can be used for any purpose and I am in no way liable for any damages caused.
- www.ivl-projecteuler.com/home 330+ solutions in Python as of 2025. Random looking problem selection. On GitHub: github.com/igorvanloo/Project-Euler-Explained under Unlicense license, a public domain license.
- www.nayuki.io/page/project-euler-solutions. Large number of solutions, mostly in Java and Python primarily but also Mathematica and Haskell sometimes. Proprietary license.
Repositories with hints but no solutions:
Basically no one has ever had the patience to create a single source that solves them all, all the above were done by individuals and stopped at some point. What we need is either a collaborative solution, or... LLMs.
Using Lean or other programmable proof assistants to solve Project Euler is the inevitable collision of two autisms. In particular, using Lean to prove that you have the correct solution, just making a Lean program that prints out the correct solution is likely now trivial as of 2025 by asking an LLM to port a Python solution to the new language.
Some efforts:
- github.com/mfornet/project-euler-lean Attempts proofs, but only did Project Euler problem 1 :-)
- github.com/pcpthm/pe solved the first 50, but as stated on the README itself, no proofs, so boring
- unreasonableeffectiveness.com/learning-lean-4-as-a-programming-language-project-euler/ solves 4, but no proofs
Mentions:
- Alex J. Best (Jun 29 2022 at 14:20) on the Lean Zulip mentions:That dude was actually working at harmonic.fun as of 2025, bastard.
It would also be very interesting to collect verified fast Project Euler solutions for Lean 4 at some point, this would simultaneously work out the compiled speed and the mathematics libraries which would be fun.
- codeforces.com/blog/entry/124615
In other proof assistants, therefore with similar beauty:
- Coq
- github.com/airobo/Project-Euler-in-Coq: 1 and 2 with proofs
The beauty of Project Euler is that it would serve both as a AI code generation benchmark and as an AI Math benchmark!
Bibliography:
Claude says he's from the UK and has a background in mathematics. Oxbridge feels likely. How I Failed, Failed, and Finally Succeeded at Learning How to Code says he started off on the ORIC computer, which is British-made, so he is likely British.
This was a registration CAPTCHA problem as of 2025:Python solution:At: euler/0.py
Among the first 510 thousand square numbers, what is the sum of all the odd squares?
s = 0
for i in range(1, 510001, 2):
s += i*i
print(s)Solution:
233168 Articles were limited to the first 100 out of 1992 total. Click here to view all children of Knowledge olympiad by domain of knowledge.
Articles by others on the same topic
There are currently no matching articles.
