TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listOct 24, 2022 20:49Kenneth MaplesKenneth MaplesScore: 80,000Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2022 20:4979,42454,250,30227,361,0002,026,0002,277,376
2Oct 24, 2022 20:4979,50055,603,72327,387,0002,028,0002,277,376
3Oct 24, 2022 20:4979,52455,158,55028,410,0001,014,0002,494,464
4Oct 24, 2022 20:4979,57353,737,88128,427,0001,015,0002,277,376
5Oct 24, 2022 20:4979,60053,509,83628,437,0001,015,0002,277,376
6Oct 24, 2022 20:4979,60550,973,25228,439,0001,015,0002,498,560
7Oct 24, 2022 20:4980,00054,589,42227,559,0002,041,0002,281,472
8Oct 24, 2022 20:4980,07858,570,33329,629,00002,281,472
9Oct 24, 2022 20:4980,12762,126,99527,603,0002,044,0002,490,368
10Oct 24, 2022 20:4983,234101,015,92630,796,75502,232,320
11Oct 24, 2022 20:4983,945113,576,80831,059,49402,224,128
12Oct 24, 2022 20:4984,20498,139,12431,155,57402,228,224