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 13, 2022 19:53Kenneth MaplesKenneth MaplesScore: 74,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2022 19:5374,30850,236,44527,494,00002,277,376
2Oct 13, 2022 19:5374,31656,138,71725,461,0002,036,0002,498,560
3Oct 13, 2022 19:5374,40551,861,39825,491,0002,039,0002,494,464
4Oct 13, 2022 19:5374,41949,657,96927,535,00002,277,376
5Oct 13, 2022 19:5374,51655,925,38724,508,0003,063,0002,277,376
6Oct 13, 2022 19:5374,58454,021,90726,611,000985,0002,277,376
7Oct 13, 2022 19:5374,73560,829,62826,628,0001,024,0002,277,376
8Oct 13, 2022 19:5374,75454,373,14026,635,0001,024,0002,502,656
9Oct 13, 2022 19:5374,88654,017,64221,551,0006,157,0002,502,656
10Oct 13, 2022 19:5378,904122,148,73829,194,58802,224,128
11Oct 13, 2022 19:5379,12583,594,79729,276,33302,224,128
12Oct 13, 2022 19:5379,77081,049,33629,514,99402,232,320