aoc2018 VS advent-of-code

Here's an example where switching to int8/int16 sped up my program 3x, but insignificantly compared to development and compile times, namely from 15 to 5 ms. I haven't profiled it but I suspect it's because of the reduced memmove amounts in my improvised bsearch-sorted-array-insertion. Made this yesterday, solution to Advent of Code 2018 day 20: https://github.com/ednl/aoc2018/blob/main/20.c

I made this jupyter notebook for a better idea and to directly compare different grid serial numbers. I think the condition "stop when no new max has been found twice in a row" will work most of the time. I tested a few other serial numbers and it seemed OK: the condition is only true directly AFTER the absolute maximum. But yes, there could well be other serial numbers where there is a dip of length 2 BEFORE the absolute maximum. Screenshot of the graph from the notebook: https://i.imgur.com/VXXpZnh.png

This is the seventh year puzzles, if you want to check out previous years take a look at: 2015, 2016, 2017, 2018, 2019, 2020

Well, I think I mostly got it. But what I couldn't figure out was which updates to skip, so maybe it can get a bit faster still. Time on the M1 Mac Mini was 4.3 ms for combined user+system, see below. That system time being as long as the user time is maybe from the massive heap allocation and init to zero at program start? I also tried to do it dynamically with malloc, without block initialisation, but that was a tiny bit slower, so I left it as a static array. Pi 400: 98 ms, old Macbook from 2013: 36 ms (both same deal: user time = system time). Code: https://github.com/ednl/aoc2018/blob/main/day09alt.c

This is my solution in C which runs in under 2 ms: https://github.com/ednl/aoc2018/blob/main/day16.c

GitHub

Since Christmas I've slowly been going through the past events (in reverse chronological order). For me half of the fun was building up my Utilities library, which many solutions took full advantage of. My repo can be found on GitHub here. My README contains my 6 favorite puzzles from every year.

My code can be found here on GitHub. Each day gets it's own folder, for this problem the important files are: