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:51Franek KortaFranek KortaScore: 101,519Success
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:5182,03691,340,45830,353,41802,297,856
2Apr 9, 2023 19:5185,74096,918,45231,723,92302,170,880
3Apr 9, 2023 19:5185,91593,529,00531,788,51202,293,760
4Apr 9, 2023 19:51100,26857,049,15736,097,0001,002,0002,527,232
5Apr 9, 2023 19:51100,98958,259,64937,366,00002,531,328
6Apr 9, 2023 19:51101,50564,668,95437,557,00002,445,312
7Apr 9, 2023 19:51101,51963,923,31436,547,0001,015,0002,527,232
8Apr 9, 2023 19:51101,52761,474,74837,565,00002,269,184
9Apr 9, 2023 19:51101,80368,317,36337,667,00002,527,232
10Apr 9, 2023 19:51102,30566,311,43636,857,000996,0002,265,088
11Apr 9, 2023 19:51102,66862,127,24736,988,000999,0002,437,120
12Apr 9, 2023 19:51103,08661,908,95136,135,0002,007,0002,437,120