bigboy

/g/ has a tradition of making 'big boy' inputs, much bigger data inputs for the various challenges, as a sort of voluntary filter that splits the O(N^Compsci graduate) from the real hackers who can google quicksort, and the occasional madman who considers letting O(N^3) code run for 5 hours an acceptable workflow.
These inputs will test your implemention to its limit. Either that, or your patience and the gaming laptop mom bought you.

Some of these inputs have different rules from the default AOC inputs; these ones have the extra rules quoted. Some of the inputs also have the 'answer' hidden in a details tag beneath them, so you can check your result without spoiling yourself.

Big Boy: Day 1

The target sum is 99920044 rather than 2020.
Also, there are apparently multiple valid solutions to part 2 for the bigboy, as it was made with part1 in mind...
Correction: anons say this dataset only has one valid solution!
Day One Spoiler: The number triplet
20940485, 38299301, 40680258 are the three numbers that sum to 99920044.

Big Boy: Day 2
Day Two Spoiler: Number of valid passwords
Number of valid passwords: 201017


Big Boy: Day 3
Anonymous 12/03/20(Thu)16:52:32 No.79018775 Day 3 Big Boy:

Map:
https://files.catbox.moe/xinqum.txt

There are 225 slopes. Consider all slopes of the form: Right { 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 54, 64 } down { 1, 5, 7, 11, 13, 17, 19, 23, 25, 29, 31, 35, 37, 41, 47 }.

Day Three Spoiler: Multiple of trees

The number of trees hit in each of the 225 runs above multiplied together is: 17610943701614472072288053287663438243678688996755913903842157568292187914837222236951077329698403071045704974230421598864084228268936109862006648397002421422925969419299408459030768017917674978488359325868164881961855356652870557047512521674031528001858526693814975159059962413231321791039625558485217437533122848025687980086359534723988137646559629291237723180941268693883357606636184272741808454861936572497920000000000000000000000000000000000000000000000000000000000

Big Boy: Day 4
Anonymous 12/04/20(Fri)14:58:51 No.79035298▶>>79035392 >>79035440 >>79035507 >>79035582  
I decided to make a big boy input for anyone who's interested  
https://files.catbox.moe/52afc3.txt  
My times:  
0.8s for part 2 only, using >>79033783  
1.2s for both parts, using the C++ solution in >>79032211  

It even triggered a bug in my C++ solution that I didn't discover earlier.

Day Four Spoiler: Numbers of valid passports

part 1: 232003 part 2: 138920

Big Boy: Day 10

Anonymous 12/10/20(Thu)07:52:03 No.79134045▶ Bigboy generator for day 10:

import random rand = random.Random(0) # set seed with open("bigboy.txt", "w") as f: n = 0 for in range(100000): n += 1 + rand.randint(0, 1) * 2 f.write(str(n) + "\n")

Day Ten Spoiler

Results for bigboy: Part1: 2500012944 log10(Part2): 16822.69818827645 (used log10 because the result is too large for a post)


Tags: