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 20:19Franek KortaFranek KortaScore: 83,532Success
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 20:1980,03254,788,04729,612,00002,424,832
2Apr 9, 2023 20:1981,01951,885,14528,978,000999,0002,510,848
3Apr 9, 2023 20:1981,16252,480,44629,029,0001,001,0002,527,232
4Apr 9, 2023 20:1981,41954,120,87829,121,0001,004,0002,265,088
5Apr 9, 2023 20:1982,15157,066,70129,383,0001,013,0002,424,832
6Apr 9, 2023 20:1982,87857,679,83930,665,00002,265,088
7Apr 9, 2023 20:1983,53254,858,80329,877,0001,030,0002,269,184
8Apr 9, 2023 20:1984,45750,307,03929,233,0002,016,0002,527,232
9Apr 9, 2023 20:1984,70055,227,25030,329,0001,010,0002,420,736
10Apr 9, 2023 20:1987,29490,075,14332,298,67402,293,760
11Apr 9, 2023 20:1987,832104,678,49332,497,83702,174,976
12Apr 9, 2023 20:1989,04698,855,35232,947,12002,174,976