Posts and replies

Part 2 of day 6 of #AdventOfCode is being a little tricky, because I've backed myself into a corner where my I have an O(MN) algorithm. I've managed to reduce M so it grows slower than N, but this all would have been avoided if I'd just thrown more memory at the problem or implemented a hash table.

Took a quick look ahead at day 7, and it looks like we've got >32bit integers, which is also tricky, but I think I can reuse some old code for that.