AdventOfCode2023 VS adventofcode

https://github.com/rumkugel13/AdventOfCode2023/blob/main/day08.go

https://github.com/ednl/adventofcode/blob/main/2023/11.c https://github.com/ednl/adventofcode/blob/main/2023/11alt.c

First estimate of the lower bound on a single-threaded CPU solution with a ten year old computer is about 10 hours, or 26 hours on a Raspberry Pi 4, ha ha. github

Aww, Eric was too kind to us and made sure that we didn't have to detect loops! With some nifty optimisations, my whole program runs in 2.5 ms on a Raspberry Pi 4. Code with lots of comments: https://github.com/ednl/adventofcode/blob/main/2023/08.c My walk function:

Complete code with lots of comments: https://github.com/ednl/adventofcode/blob/main/2023/07.c

I solved the quadratic equation and that makes the whole program run in 1.2 ms on a Raspberry Pi 4. But simply trying every possible button time isn't much slower: also took milliseconds, shrug. Here is my very verbose function to solve per race. The sq < 0 test was not necessary for the example or my input. Complete code: https://github.com/ednl/adventofcode/blob/main/2023/06.c

C has no intersection operation, so I sorted the numbers and counted the matches "manually". Only kept an array for the number of card copies and could do the rest while reading the input. Runs in 3.2 ms on an old 2013 iMac, 3.9 ms on a Raspberry Pi 4 (cpu governor = performance). Short code, only one separate function for sorting: https://github.com/ednl/adventofcode/blob/main/2023/04.c