Python solutions Project Euler - https://projecteuler.net/
OS: Windows 10 Home 64-bit
CPU: Intel Core i7 @ 2.50GHz
GPU: NVIDIA GeForce GTX 850M
RAM: 16,0GB Dual-Channel DDR3 @ 798MHz
IDE: PyCharm Community Edition
Number | Title | Date | Runtime | Solved | Link |
---|---|---|---|---|---|
001 | Multiples of 3 and 5 | 26/01/2017 | 0.00034s | ![]() |
Problem 1 |
002 | Even Fibonacci numbers | 26/01/2017 | < 0.00001s | ![]() |
Problem 2 |
003 | Largest prime factor (complicated) | 26/01/2017 | 0.04257s | ![]() |
Problem 3 |
003 | Largest prime factor (short) | 26/01/2017 | 0.00060s | ![]() |
Problem 3 |
004 | Largest palindrome product | 26/01/2017 | 0.00632s | ![]() |
Problem 4 |
005 | Smallest multiple (brute force) | 26/01/2017 | 8.03642s | ![]() |
Problem 5 |
005 | Smallest multiple (efficient) | 26/01/2017 | 0.00013s | ![]() |
Problem 5 |
006 | Sum square difference | 26/01/2017 | < 0.00001s | ![]() |
Problem 6 |
007 | 10001st prime | 26/01/2017 | 6.53110s | ![]() |
Problem 7 |
008 | Largest product in a series | 26/01/2017 | 0.00181s | ![]() |
Problem 8 |
009 | Special Pythagorean triplet | 28/01/2017 | 0.11237s | ![]() |
Problem 9 |
010 | Summation of primes | 26/01/2017 | 0.53019s | ![]() |
Problem 10 |
011 | Largest product in a grid | 29/01/2017 | 0.00092s | ![]() |
Problem 11 |
012 | Highly divisible triangular number | 28/01/2017 | 5.81420s | ![]() |
Problem 12 |
013 | Large sum | 27/01/2017 | 0.00011s | ![]() |
Problem 13 |
014 | Longest Collatz sequence | 26/01/2017 | 2.20673s | ![]() |
Problem 14 |
015 | Lattice paths | 28/01/2017 | 0.00020s | ![]() |
Problem 15 |
016 | Power digit sum | 27/01/2017 | 0.00018s | ![]() |
Problem 16 |
017 | Number letter counts | 28/01/2017 | 0.00338s | ![]() |
Problem 17 |
018 | Maximum path sum I | 29/01/2017 | 0.00019s | ![]() |
Problem 18 |
019 | Counting Sundays | 30/01/2017 | 0.00108s | ![]() |
Problem 19 |
020 | Factorial digit sum | 28/01/2017 | 0.00010s | ![]() |
Problem 20 |
021 | Amicable numbers | 28/01/2017 | 0.15887s | ![]() |
Problem 21 |
022 | Names scores | 30/01/2017 | 0.01165s | ![]() |
Problem 22 |
023 | Non-abundant sums | 30/01/2017 | 15.48666s | ![]() |
Problem 23 |
024 | Lexicographic permutations | 30/01/2017 | 0.88881s | ![]() |
Problem 24 |
025 | 1000-digit Fibonacci number | 28/01/2017 | 0.13854s | ![]() |
Problem 25 |
026 | Reciprocal cycles | 30/01/2017 | 0.41314s | ![]() |
Problem 26 |
027 | Quadratic primes | 30/01/2017 | 6.22978s | ![]() |
Problem 27 |
028 | Number spiral diagonals | 28/01/2017 | 0.00051s | ![]() |
Problem 28 |
029 | Distinct powers | 30/01/2017 | 0.00911s | ![]() |
Problem 29 |
030 | Digit fifth powers | 30/01/2017 | 5.45839s | ![]() |
Problem 30 |
031 | Coin sums | 30/01/2017 | 0.03779s | ![]() |
Problem 31 |
032 | Pandigital products | 31/01/2017 | 0.18051s | ![]() |
Problem 32 |
033 | Digit cancelling fractions | 31/01/2017 | 0.01764s | ![]() |
Problem 33 |
034 | Digit factorials | 31/01/2017 | 0.28616s | ![]() |
Problem 34 |
035 | Circular primes | 31/01/2017 | 1.17886s | ![]() |
Problem 35 |
036 | Double-base palindromes | 31/01/2017 | 0.71500s | ![]() |
Problem 36 |
037 | Truncatable primes | 31/01/2017 | 0.43337s | ![]() |
Problem 37 |
038 | Pandigital multiples | 01/02/2017 | 0.03272s | ![]() |
Problem 38 |
039 | Integer right triangles | 01/02/2017 | 0.17144s | ![]() |
Problem 39 |
040 | Champernowne's constant | 01/02/2017 | 0.15263s | ![]() |
Problem 40 |
041 | Pandigital prime | 01/02/2017 | 4.88541s | ![]() |
Problem 41 |
042 | Coded triangle numbers | 01/02/2017 | < 0.00001s | ![]() |
Problem 42 |
043 | Sub-string divisibility | 02/02/2017 | 6.39962s | ![]() |
Problem 43 |
044 | Pentagon numbers | 02/02/2017 | 0.43241s | ![]() |
Problem 44 |
045 | Triangular, pentagonal, and hexagonal | 02/02/2017 | 0.08220s | ![]() |
Problem 45 |
... | ... | ... | ... | ... | ... |
048 | Self powers | 29/01/2017 | 0.00070s | ![]() |
Problem 48 |