A series of challenges in spirit of the holidays 🎄
Sad Update: I am postponing my progress on AoC temporarily due to schoolwork, so ranks will not be my goal this year. Efficiency and number of problems solved are still fair game when I come back :)
All of these solutions will be written and verified with Python, along with the following goals:
- Efficiency, where a more efficient algorithm will do the job without over-killing the problem. I am aiming for sub-15 seconds using plain Python2.7 (no PyPy or JIT compilers allowed) for these tasks.
- Organization. Avoid duplicate code for better readability.
- Keep it simple!
- Day 5: Lost plenty of time to misreading the problem.
- Day 6: Time lost from missing the constraint of the root node.
| Day | Name | Part 1 | Part 2 | Runtime |
|---|---|---|---|---|
| 1 | The Tyranny of the Rocket Equation | 20th | 99th | < 1ms |
| 2 | 1202 Program Alarm | 22nd | 12th | 70ms |
| 3 | Crossed Wires | 183rd | 98th | 150ms |
| 4 | Secure Container | 11th | 23rd | < 1ms |
| 5 | Sunny with a Change of Asteroids | 1748th | 1043rd | < 1ms |
| 6 | Universal Orbit Map | 218th | 130th | 5ms |
| 7 | To be continued... |
Current score: 422 points
Total runtime: 225 milliseconds