{"push_id":3174492358,"size":15,"distinct_size":15,"ref":"refs/heads/master","head":"fa7b4378723af5e5c31fd303bae9817c8e6c30cf","before":"1ee9b6c8662e55954834d0d3f016e548b520200a","commits":[{"sha":"b38f192161aeec0d0186be81d3d791f8330e435c","author":{"name":"Oliver Smith","email":"c539153ba1f947bd4b6f910263b967c4a0a62357@uptheinter.net"},"message":"Advent of Code - Initial commit.\n\nIncludes days 1 thru 5.","distinct":true,"url":"https://api.github.com/repos/Olipro/AdventOfCode-2018/commits/b38f192161aeec0d0186be81d3d791f8330e435c"},{"sha":"3be3e4a362dd8d8b0b9e60a8ce348a63b86235d9","author":{"name":"Oliver Smith","email":"c539153ba1f947bd4b6f910263b967c4a0a62357@uptheinter.net"},"message":"Day 3: Implement a better performing solution.","distinct":true,"url":"https://api.github.com/repos/Olipro/AdventOfCode-2018/commits/3be3e4a362dd8d8b0b9e60a8ce348a63b86235d9"},{"sha":"837a8fbb195f40595a01fb694ff577610f56a1fb","author":{"name":"Oliver Smith","email":"c539153ba1f947bd4b6f910263b967c4a0a62357@uptheinter.net"},"message":"Day 6 - Solution.\n\nThis adds the solution for day 6.","distinct":true,"url":"https://api.github.com/repos/Olipro/AdventOfCode-2018/commits/837a8fbb195f40595a01fb694ff577610f56a1fb"},{"sha":"f304b1c111f332b4d2045e80cbcd028e760cb2b6","author":{"name":"Oliver","email":"c539153ba1f947bd4b6f910263b967c4a0a62357@uptheinter.net"},"message":"Add Day 7 - Part 1.","distinct":true,"url":"https://api.github.com/repos/Olipro/AdventOfCode-2018/commits/f304b1c111f332b4d2045e80cbcd028e760cb2b6"},{"sha":"8a2e92e7b6af8176c0889b7679a61b1417ee3af1","author":{"name":"Oliver","email":"c539153ba1f947bd4b6f910263b967c4a0a62357@uptheinter.net"},"message":"Add Day 8 - Part 1 & 2","distinct":true,"url":"https://api.github.com/repos/Olipro/AdventOfCode-2018/commits/8a2e92e7b6af8176c0889b7679a61b1417ee3af1"},{"sha":"14bf024f1f854d63f2f0f8a9b5e916d25fbb8fca","author":{"name":"Oliver","email":"c539153ba1f947bd4b6f910263b967c4a0a62357@uptheinter.net"},"message":"Add Day 10 - Parts 1 & 2","distinct":true,"url":"https://api.github.com/repos/Olipro/AdventOfCode-2018/commits/14bf024f1f854d63f2f0f8a9b5e916d25fbb8fca"},{"sha":"f70e1fa5ab6a271822db8ae64047bda67f1815b2","author":{"name":"Oliver","email":"c539153ba1f947bd4b6f910263b967c4a0a62357@uptheinter.net"},"message":"Added Day 7 - Part 2.","distinct":true,"url":"https://api.github.com/repos/Olipro/AdventOfCode-2018/commits/f70e1fa5ab6a271822db8ae64047bda67f1815b2"},{"sha":"55bec67fa1f58a8063bc19e90bd1ae40d76d070b","author":{"name":"Oliver","email":"c539153ba1f947bd4b6f910263b967c4a0a62357@uptheinter.net"},"message":"Added Day 9 - Parts 1 & 2\n\nNote: Part 2 is a symlink since the code required for both parts of the\nchallenge is completely identical.","distinct":true,"url":"https://api.github.com/repos/Olipro/AdventOfCode-2018/commits/55bec67fa1f58a8063bc19e90bd1ae40d76d070b"},{"sha":"51ba5cff08513d20113837b6f533cd3d224fdf49","author":{"name":"Oliver","email":"c539153ba1f947bd4b6f910263b967c4a0a62357@uptheinter.net"},"message":"Added Day 11 - Parts 1 & 2\n\nNote: Part 2 was lazily done and uses some multithreading just to speed\nit up since the solution is pretty lazy.","distinct":true,"url":"https://api.github.com/repos/Olipro/AdventOfCode-2018/commits/51ba5cff08513d20113837b6f533cd3d224fdf49"},{"sha":"39460f6f7f17bd07a1141a4e9014fe39e50e5631","author":{"name":"Oliver","email":"c539153ba1f947bd4b6f910263b967c4a0a62357@uptheinter.net"},"message":"Added Day 12 - Parts 1 & 2\n\nSolves the challenge for day 12.","distinct":true,"url":"https://api.github.com/repos/Olipro/AdventOfCode-2018/commits/39460f6f7f17bd07a1141a4e9014fe39e50e5631"},{"sha":"248085e0d996a99d58e0b6125880b0f3a35bcbb2","author":{"name":"Oliver","email":"c539153ba1f947bd4b6f910263b967c4a0a62357@uptheinter.net"},"message":"Added Day 13 - Parts 1 & 2\n\nSolves the challenge for day 13.","distinct":true,"url":"https://api.github.com/repos/Olipro/AdventOfCode-2018/commits/248085e0d996a99d58e0b6125880b0f3a35bcbb2"},{"sha":"1055b9681f33b12a6c3924841d93893e8a59ecbc","author":{"name":"Oliver","email":"c539153ba1f947bd4b6f910263b967c4a0a62357@uptheinter.net"},"message":"Added Day 14- Parts 1 & 2\n\nSolves the challenge for day 14.","distinct":true,"url":"https://api.github.com/repos/Olipro/AdventOfCode-2018/commits/1055b9681f33b12a6c3924841d93893e8a59ecbc"},{"sha":"40b3ff740bb31dcc87d5770ea6d9f43625b35e98","author":{"name":"Oliver","email":"c539153ba1f947bd4b6f910263b967c4a0a62357@uptheinter.net"},"message":"Added Day 15 - Parts 1 & 2\n\nThis solution is horribly unoptimised and does far more work than is\nnecessary. I intend to come back to this one and clean it up but for\nnow, I want to focus on completing the other challenges.\n\nThe biggest issue is that there is more path-finding going on than\nneeded and no caching at all.\n\npart1 runs in about 7 seconds. part2 takes a minute or two. Garbage.","distinct":true,"url":"https://api.github.com/repos/Olipro/AdventOfCode-2018/commits/40b3ff740bb31dcc87d5770ea6d9f43625b35e98"},{"sha":"becc9f390bd41fb89e566085d11ae293e4ff1a89","author":{"name":"Oliver","email":"c539153ba1f947bd4b6f910263b967c4a0a62357@uptheinter.net"},"message":"Added Day 16 - Parts 1 & 2\n\nSolves Day 16 in a clean, elegant and fast manner.","distinct":true,"url":"https://api.github.com/repos/Olipro/AdventOfCode-2018/commits/becc9f390bd41fb89e566085d11ae293e4ff1a89"},{"sha":"fa7b4378723af5e5c31fd303bae9817c8e6c30cf","author":{"name":"Oliver","email":"c539153ba1f947bd4b6f910263b967c4a0a62357@uptheinter.net"},"message":"Day 15: Make the performance a bit less horrible.\n\nA caching layer is now implemented which improves the performance by\nalmost 4x although a lot more could be done.\n\nThe readme has been updated to mention the issue with this day.","distinct":true,"url":"https://api.github.com/repos/Olipro/AdventOfCode-2018/commits/fa7b4378723af5e5c31fd303bae9817c8e6c30cf"}]}
{"actor":{"display_login":"Olipro"}}