Bitbucket is a code hosting site with unlimited public and private repositories. We're also free for small teams!

I'm attempting Project Euler problems in Python.

My only personal restriction is to limit code to python standard library only.
That means I won't be using numpy or whatever, although I can use a lib if
I wrote it from scratch myself. However, that also means I get to take advantage
of itertools, which makes a ton of these problems super easy.

For the most part, I will try to optimize the answers but keep clear code
when the performance difference isn't much. I'd prefer all the answers to return
within 10s, but that's probably not possible (especially in the later problems).

I also wrote them in python2.7. No guarentees that it'll work in lower versions.

WARNING: This code contains spoilers. It has python solutions for all problems
I've completed, as well as the answers in the unittest file.  If you're reading
this to cheat, the only person you're cheating is yourself. Project Euler is
not a competition, but a learning tool.  Of course, if you're stuck on a problem
and would like to see someone's (i.e. my) take on it, looking at my solution
is also a learning opportunity, so don't let anyone else tell you differently.

Recent activity

Tip: Filter by directory path e.g. /media app.js to search for public/media/app.js.
Tip: Use camelCasing e.g. ProjME to search for
Tip: Filter by extension type e.g. /repo .js to search for all .js files in the /repo directory.
Tip: Separate your search with spaces e.g. /ssh pom.xml to search for src/ssh/pom.xml.
Tip: Use ↑ and ↓ arrow keys to navigate and return to view the file.
Tip: You can also navigate files with Ctrl+j (next) and Ctrl+k (previous) and view the file with Ctrl+o.
Tip: You can also navigate files with Alt+j (next) and Alt+k (previous) and view the file with Alt+o.