Project Euler Problems Completed
 Share
The version of the browser you are using is no longer supported. Please upgrade to a supported browser.Dismiss

 
View only
 
 
ABCDEFGHIJKLMNOPQRSTUVWXYZAAABAC
1
Date #DifficultyLanguageTime to CodeRun time (s)TechniqueMistakes/pain pointsNotes#
2
3
4
5
65Haskell65
6
7/418835%C, Wolfram4 hours0.0021Corollary of Fermat's little theorem. Had to browse through a list of properties on Wikipedia because I don't know modular arithmetic.Run time includes only the C code.188
7
7/5185%C1.5 hours0.0020Optimizing a path through a graph1) Couldn't figure out why I kept on getting a segmentation error. Turns out I was calling the wrong function and got a stack overflow. 2) Referenced the wrong variable. Lesson: name things strategically to avoid this type of mistake. 18
8
7/6205%Haskell10 minutes0.0060Tail recursion20
9
7/6225%
Vim, unix sort, Haskell
57 minutes0.0952IO, using tail recursion to process lists—ugh!!22
10
7/6245%Haskell1 hour0.1527tree sorting, permutationswasted a lot of time trying to eliminate impossible combinations by hand24
11
7/68920%Haskell2.5 hours0.0097Mostly stupidity. Needed a string replace function. Haskell package management is a terrible pain. 89
12
7/6265%Haskelltoo long4.5070Haskell is hard
13
8/10115%Chours0.0021casting between multidimensional arrays and pointers
14
8/1110735%C3 days0.0022linked list queues, bit fields (not in struct, but as ull), Prim's algo to find minimum spanning treeso...many...subtle...bugs after I figured out my strategy on the first day.knew nothing about MST and Prim's algo coming in. Came up with those two concepts on my own, just in terms of breadth-first search. Learned their names after finding the solution.

I might as well properly learn CS rather than attempting to rediscover it.
15
8/12125%C45 min17.1570
16
8/12135%Haskell3 min0.0064Free big integers in Haskell means nearly zero effort.
17
8/12165%Haskell10 min0.0061
18
8/13215%C25 min0.0472
19
8/13235%C15 min0.0267
20
8/13255%Haskell15 min0.0069
21
8/13275%C25 min0.7076
22
8/13285%C15 min0.0021
23
8/13295%Python5 min0.0296
24
8/13305%Haskell30 min0.0938
25
8/13315%Haskell30 min300.0000
26
8/13325%Python (pypy)40 min4.7860
27
8/13345%Python (pypy)45 min6.9120Gosh, I hate Python. It tries to be like C and Haskell, but it's terrible at both
28
8/13365%Python (pypy)10 min0.3051
29
8/13375%C28 min0.4696
30
8/14385%Python (pypy)49 min1.6700You can't step through Python list comprehensions? Map and reduce aren't Pythonic? What am I supposed to use, then?
31
8/14395%Python (pypy)12 min0.4714Procedurally, Python's not bad actually.
32
8/14405%Python (pypy)30 min0.1890
33
8/14415%Ca few hours0.0727permutationsturns out that the Sieve of Eratosthenes algo I was using all this time could be tuned up just bit for orders of magnitude speed increase.
34
8/15425%Awk60 min0.0113Awk is nice.
35
8/15435%C9 min0.5015mostly reused code from #41
36
8/15445%C40 min?8.7960
37
8/15455%C20 min0.0025
38
8/15465%C15 min0.0023
39
8/15475%C13 min0.0054
40
8/15485%Haskell10 min0.0100
41
8/15505%C30 min0.0170
42
8/15525%Python (pypy)10 min0.1583
43
8/15555%Python (pypy)20 min0.2347
44
8/15565%Python (pypy)2 min0.9160
45
8/15595%Python and iTerm15 minfew seconds
46
8/186120%C3 hours0.0056aggressively filtering out the search space at every step
47
48
7610%(Guile) Scheme8 hours0.7789need to improve solution to do tail tree recursion
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
Loading...
Main menu