My solutions to Advent of Code. Mainly for my own entertainment. I make no claims that these are good solutions.
So far, all my solutions have been implemented in pure Ruby.
I've also included some utilities and custom libraries in this repository.
Fetches input data (preventing paste errors) or private leaderboard JSON data.
Parses private leaderboard JSON data and outputs some interesting statisticts:
- Individual top list for each star.
- A matrix of players and their solution times for each star.
- A top list that sorts players (with the same amount of stars) on the total time taken between solving part 1 and part 2 for each day. Can easily be gamed with multiple accounts, but doesn't require people to start working on the puzzles immediately when they unlock.
My starting point for each puzzle. Contains the stuff I mostly add to my solutions.
Runs the main solution (shortest filename) for every day of a given year, with a timer running for each.
Includes an optional rehearsal mode similar to the bmbm function of Ruby's Benchmark library.
Library for communicating with adventofcode.com. Mainly for getting the input automatically using AOC.input_file().
Library containing common math features used in a few solutions.
A simple (but still sufficiently fast) priority queue implementation in pure Ruby. About as fast as other pure Ruby implementations I've found, but has no dependencies.
Library for running processing on multiple CPU cores.
Threading isn't sufficient in normal Ruby due to the Global Interpreter Lock limiting execution to only one thread at a time. To achieve true parallelism, we need to fork (which doesn't work in Windows). Also compatibile with JRuby (which does have true parallelism, but can't fork).
This library is NOT recommended for everyday use (forking can be quite expensive), but works well in this context.