From 866b0694ee63fc9613bfae7c5d7bb432bfbe430d Mon Sep 17 00:00:00 2001 From: Tomasz Kramkowski Date: Fri, 10 Dec 2021 23:13:48 +0000 Subject: aoc2021-bigboys: Cleanup --- content/projects/aoc2021-bigboys.md | 17 +++++++++-------- 1 file changed, 9 insertions(+), 8 deletions(-) (limited to 'content/projects') diff --git a/content/projects/aoc2021-bigboys.md b/content/projects/aoc2021-bigboys.md index 0961deb..5ea0356 100644 --- a/content/projects/aoc2021-bigboys.md +++ b/content/projects/aoc2021-bigboys.md @@ -47,7 +47,8 @@ them up nicely. * 50000 vents on a 10000000x10000000 field [Download 5-50000-10000000.in.xz (660KiB compressed / 1.7MiB decompressed)][5-50000-10000000.in.xz] Part 1: 72068735 - Part 2: 113830179 + Part 2: 113830179 + Note: This should take under a minute in total with a compiled language. ## Day 6 @@ -55,7 +56,7 @@ them up nicely. Solution: 378346 digits 4182599183...6707352532 * The example sequence `3,4,3,1,2` after 67108864 (2^26) cycles Solution: 2539031 digits 3060363545...5483141435 - This took my numpy solution (with dtype=object) 10 minutes on a 5950x. + Note: This should take under a minute. ## Day 7 @@ -63,15 +64,15 @@ them up nicely. [Download 7-1000000-2.in.xz (3.1MiB compressed / 7.2MiB decompressed)][7-1000000-2.in.xz] Part 1: 348121442862 Part 2: 97051441111920642 - Note: This should be doable in about a second. Unfortunately making it take - much longer would require making it much bigger. + Note: This should be doable in under a second. ## Day 8 -* 100000 entries - [Download 8-100000.in.xz (2.8MiB compressed / 8.1MiB decompressed)][8-100000.in.xz] - Part 1: 159946 - Part 2: 498570828 +* 100000 entries + [Download 8-100000.in.xz (2.8MiB compressed / 8.1MiB decompressed)][8-100000.in.xz] + Part 1: 159946 + Part 2: 498570828 + Note: This should be doable in under a second (language dependant). [3-1000001-100.in.xz]: https://the-tk.com/files/aoc2021-bigboys/3-1000001-100.in.xz [4-900-15.in.xz]: https://the-tk.com/files/aoc2021-bigboys/4-900-15.in.xz -- cgit v1.2.3-54-g00ecf