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 listApr 9, 2023 19:44Franek KortaFranek KortaScore: 79,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 19:4477,07651,464,34528,518,00002,441,216
2Apr 9, 2023 19:4477,12451,710,96728,536,00002,441,216
3Apr 9, 2023 19:4477,98162,153,98727,859,000994,0002,523,136
4Apr 9, 2023 19:4478,56855,267,07726,063,0003,007,0002,449,408
5Apr 9, 2023 19:4479,01655,250,97927,220,0002,016,0002,527,232
6Apr 9, 2023 19:4479,14149,661,03627,263,0002,019,0002,527,232
7Apr 9, 2023 19:4479,30554,153,01929,343,00002,437,120
8Apr 9, 2023 19:4479,79250,825,27728,505,0001,018,0002,527,232
9Apr 9, 2023 19:4479,94954,484,77129,581,00002,527,232
10Apr 9, 2023 19:4485,369101,148,55831,586,52402,297,856
11Apr 9, 2023 19:4485,43087,850,75431,608,96702,293,760
12Apr 9, 2023 19:4485,61399,599,10931,676,96902,293,760