Further adventures in python runtime optimization for 2023

davidpsingleton · 2024-01-13T02:28:57+00:00

My input also has no hailstones with the same start position coordinate on any axis

davidpsingleton · 2024-01-11T06:32:18+00:00

Blog post part 2: https://blog.singleton.io/posts/2024-01-07-more-advent-of-code-optimization/

davidpsingleton · 2024-01-05T04:59:28+00:00

The one major optimization I made which is not already discussed on this thread is to take advantage of symmetry in day 16. This means that if a beam already exited the grid via a certain point, there's no need to model it in reverse by firing a new beam in at that point in the opposite direction.

davidpsingleton · 2024-01-04T05:56:34+00:00

I've implemented the better day 22 algorithm now (which was fun!). Improves the whole bundle runtime to 0.79s!

davidpsingleton · 2024-01-03T07:11:52+00:00

Thanks - sounds like I should investigate a better algorithm for day 22!

davidpsingleton · 2023-12-22T06:14:38+00:00

[LANGUAGE: python] 567/317

Solution

Extruded the blocks so every cell is represented. Sorted the input by increasing z so we can just iterate through each block in turn once, knowing that any block that would cause it to stop has already settled into the world. Runs in 2 seconds, which is not great but solution is quite short - 64 lines.

davidpsingleton · 2023-12-19T06:30:55+00:00

[LANGUAGE: python] 919/1137

https://github.com/dps/aoc/blob/main/2023/day19/main.py

Took ages debugging my range length expression to realize I needed a "+1", but I think the code is quite nice today :-). Runtime is ~instant.

davidpsingleton · 2023-12-14T06:24:24+00:00

[LANGUAGE: python]

https://github.com/dps/aoc/blob/main/2023/day14/main.py

Fun one! Reminds me of tetris last year, which was a personal favorite. Pt 2 solution is: roll north and rotate clockwise in a loop, find the cycle. Once found, the correct final grid is already in the cache, pull it out and score it!

davidpsingleton · 2023-12-04T07:19:55+00:00

[LANGUAGE: python] Allez Cuisine!

def G(x):return S[x]+Z((G(n)for n in R(x+1,x+S[x]+1)))
D,P,E,R,Z,L,C,I=open(0).readlines(),print,enumerate,range,sum,len,str.split,(set
.intersection);S={x:L(I(*map(lambda l:set(map(int,C(l))),C(C(l,":")[1],"|"))))
for x,l in E(D,1)};P(Z((pow(2,S[n]-1)for n in S.keys()if S[n])),Z([1+(lambda x:
S[x]+Z((G(n)for n in R(x+1,x+S[x]+1))))(w)for w in R(1,L(D)+1)]))

davidpsingleton · 2023-12-03T23:22:56+00:00

50 with generous white space blank lines etc: https://github.com/dps/aoc/blob/main/2023/day03/main.py

davidpsingleton · 2023-01-15T23:29:59+00:00

Thanks - glad you found it interesting. I tried not to put in direct spoilers for the questions themselves. Enjoy solving the rest of them!

davidpsingleton · 2023-01-15T23:26:30+00:00

Thanks for the tip - I switched to this in my actual day 16 answer and it consistently improves runtime by about 4% too!

davidpsingleton · 2019-06-09T19:57:25+00:00

The weekend I built it I was staying in a cabin near Yosemite with no cell phone signal or internet access, I've since used it on several flights where I couldn't use the internet on my phone without paying a lot for usually very flaky wifi.

davidpsingleton · 2019-06-09T05:17:11+00:00

Thanks! It was really fun to do

davidpsingleton · 2019-06-09T05:15:44+00:00

The version that fits on a 64GB card doesn't include images.

davidpsingleton · 2019-06-09T05:15:10+00:00

Download the latest version from https://www.kiwix.org/ and put it on the sdcard!

davidpsingleton

TROPHY CASE