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 listSep 15, 2021 17:28piculpiculScore: 84,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 17:2881,77854,860,72928,241,0002,017,0002,289,664
2Sep 15, 2021 17:2882,31651,935,95229,442,0001,015,0002,527,232
3Sep 15, 2021 17:2883,34958,593,51730,839,00002,519,040
4Sep 15, 2021 17:2883,43055,545,92228,878,0001,991,0002,289,664
5Sep 15, 2021 17:2883,47055,544,75828,892,0001,992,0002,289,664
6Sep 15, 2021 17:2883,78655,240,46529,001,0002,000,0002,289,664
7Sep 15, 2021 17:2884,03553,654,26029,087,0002,006,0002,289,664
8Sep 15, 2021 17:2884,90553,515,27530,402,0001,013,0002,523,136
9Sep 15, 2021 17:2887,16560,252,46230,236,0002,015,0002,289,664
10Sep 15, 2021 17:28113,943112,957,36642,159,06002,260,992
11Sep 15, 2021 17:28114,128115,126,59642,227,25302,244,608
12Sep 15, 2021 17:28117,108119,618,07143,329,97902,252,800