AOC 2021 Big Inputs (Big Boys)

Big inputs for Advent of Code 2021 puzzles.

• Day 3
• Day 4
• Day 5
• Day 6
• Day 7
• Day 8
• Day 9
• Day 10
• Day 11
• Day 12
• Day 14
• Day 15
• Day 17

If you have a problem with the naming scheme, rename it on your machine.

If you see any mistakes and want to tell me, my email is at the bottom of this page.

I will be publishing all the generators shortly once I find a moment to clean them up nicely.

Day 3

• 1000001 lines each with a 100 bit number
  Download 3-1000001-100.in.xz
  (14MiB compressed / 97MiB decompressed)

  Part 1: 386463119445733053722557199393548794069517420395751036911156
  Part 2: 356913958942791247617705918285570893096041618195840162127310
  

Day 4

• 900 numbers and 900 boards each 15x15 cells in size
  Download 4-900-15.in.xz
  (308KiB compressed / 796KiB decompressed)
  Part 1: 22010880
  Part 2: 5371020
• 3600 numbers and 3600 boards each 30x30 cells in size
  Download 4-3600-30.in.xz
  (5.6MiB compressed / 16MiB decompressed)
  Part 1: 1527513658
  Part 2: 199953180

Day 5

• 20000 vents on a 6400x6400 field
  Download 5-20000-6400.in.xz
  (160KiB compressed / 436KiB decompressed)
  Part 1: 6530681
  Part 2: 9039258
• 50000 vents on a 10000x10000 field
  Download 5-50000-10000.in.xz
  (404KiB compressed / 1.1MiB decompressed)
  Part 1: 30405812
  Part 2: 39512010
• 50000 vents on a 10000000x10000000 field
  Download 5-50000-10000000.in.xz
  (660KiB compressed / 1.7MiB decompressed)
  Part 1: 72068735
  Part 2: 113830179

Day 6

• The example sequence 3,4,3,1,2 after 9999999 cycles
  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.

Day 7

• 1000000 crabs
  Download 7-1000000-2.in.xz
  (3.1MiB compressed / 7.2MiB decompressed)
  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.

Day 8

• 100000 entries
  Download 8-100000.in.xz
  (2.8MiB compressed / 8.1MiB decompressed)
  Part 1: 159946
  Part 2: 498570828
  Note: This should be doable in under a second (language dependant).

Day 9

• 4096x4096 with a different basin forming algorithm than the original (I honestly don't know exactly how the original works, but I think mine produces harder basins)
  Download 9-4096-4.in.xz
  (4.3MiB compressed / 17MiB decompressed)
  Part 1: 152649
  Part 2: 101367520960
  Note: This should be doable in under a second.
• broken 4096x4096 - There are basins with multiple local minima.
  Download 9-4096-2.in.xz
  (4.3MiB compressed / 17MiB decompressed)
  Part 1: 149706
  Part 2: 4971158490375 (5292585633483 if you count duplicate basins)

Day 10

• 10000 lines each with a pre-mangled length target of 1000 characters
  Download 10-10000-1000.in.xz
  (3.1MiB compressed / 9.2MiB decompressed)

  Part 1: 32852823
  Part 2: 105721020868542718163333508098695965856824383141538359
  Part 2 % 2^64: 11022194402702354999
  Part 2 % 2^32: 1113549367
  

• 10000 lines each with a pre-mangled length target of 10000 characters
  Download 10-10000-10000.in.xz
  (30MiB compressed / 92MiB decompressed)

  Part 1: 32256063
  Part 2: 4147221136278686118851251078439942241593032865422495540589075652007224217627158672406548941332753773231145137591607755327259751330408129749234363801432056312168742919300272994666758197001661058825916005929107429822715605939942443473451119156732403958992327362236310858256528168096490885509843074970456349764872605113646021900154182133457634302249036648560726381663678169920580181158091185711536415744289810493158025390014526746339533063857301193312008845372928578055750021478792579394195467723166421532710570596861139275905662620238
  Part 2 % 2^64: 4019508546077889102
  Part 2 % 2^32: 4104032846
  

Day 11

• 100x100 octopi
  Download 11-100-2.in.xz
  (8.0KiB compressed / 12KiB decompressed)
  Part 1: 155620
  Part 2: 202
• 1000x1000 octopi
  Download 11-1000-2.in.xz
  (412KiB compressed / 980KiB decompressed)
  Part 1: 15030707
  Part 2: 454

Day 12

• 18 small caves, 9 big caves, maximum of 7 caves connected to any given one
  Download 12-18-9-7.in (240B uncompressed)
  Part 1: 617617055
  Part 2: 51532272174
• 18 small caves, 10 big caves, maximum of 7 caves connected to any given one
  Download 12-18-10-7-2.in (382B uncompressed)
  Part 1: 63130821975168
  Part 2: 9781700422939493
• 21 small caves, 12 big caves, maximum of 7 caves connected to any given one
  Download 12-21-12-7.in (352B uncompressed)
  Part 1: 29474222813529
  Part 2: 5141038157763320
• 24 small caves, 14 big caves, maximum of 7 caves connected to any given one
  Download 12-24-14-7.in (446B uncompressed)
  Part 1: 154850773837774189
  Part 2: 33501351222065201672
  Part 2 % 2^64: 15054607148355650056

Day 14

Download 14.in (822B uncompressed)

• Iterated 100000 times
  Solution: 30104 digits 2058072250...8302987714
  Solution % 2^64: 3612905615560025538
  Solution % 2^32: 4000851394
• Iterated 200000 times
  Solution: 60207 digits 2056018485...9950238903
  Solution % 2^64: 1164363483496783031
  Solution % 2^32: 1329798327
• Iterated 1000000 times
  Solution: 301031 2039661977...9465801772
  Solution % 2^64: 15865429992962593836
  Solution % 2^32: 459084844

Day 15

• 1000x1000 cave map
  Download 15-1000.in.xz
  (412KiB compressed / 980KiB decompressed)
  Part 1: 5576
  Part 2: 27759
• 10000x10000 cave map
  Download 15-10000.in.xz
  (41MiB compressed / 96MiB decompressed)
  Part 1: 55502
  Part 2: 277236

Day 17

• target area: x=117..7310, y=-9546..-89
  Part 1: 45558285
  Part 2: 69665558
• target area: x=50842..144383, y=-187041..-90458
  Part 1: 17492074320
  Part 2: 12490271023