About
We want to thank Eric Wastl for creating the Advent of Code, one of the most fun programming events of the year.
Please note that some puzzles in the advent of code are follow-ups to puzzles from a previous day. Those puzzles often expect you to extend on the solution from that day. Be aware that the backstory that Eric writes for the puzzles always suggests that there is a continuation. That might be true for the backstory, but is most often not the case for the puzzles themselves. So read carefully.
If you happen to run into such a puzzle then please come back here and press your favorite button again for a new puzzle.
At the moment I haven't implemented a check for these follow-up puzzles. If you want to add the then please go ahead and submit a PR.
This site was created by Jeroen Huinink for the Nimma.codes Advent-of-code Dojo in December 2023, using Nextjs, Tailwindcss and Github pages for hosting.
The source for this repo can be found on Github.

This site uses data from https://github.com/mevdschee/aoc-stats. Maurits created a tool that collects data from the advent of code and visualizes that. I have grabbed the file medals.json from his repo and used this data to calculate the puzzle complexity.

The data in the file shows the time it took the top 100 participants on the global leaderboard to collect the two medals for every day, if they made it that day. I calculate the complexity as the sum of the average score for the first medal and the average score for the second medal.

We can of course debate whether this is the best way to assess the complexity, but hey, this is just for fun. And if my method really annoys you, feel free to submit a PR with an alternative algorithm. (See above for the link to the repo).

Back