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 8, 2025 21:03Aleksei ShahoikaAleksei ShahoikaScore: 4,451,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2025 21:034,446,3111,673,417,7701,643,137,0001,998,0002,285,568
2Sep 8, 2025 21:034,446,7511,667,679,3751,643,299,0001,999,0002,265,088
3Sep 8, 2025 21:034,447,6321,671,307,0681,644,625,000999,0002,265,088
4Sep 8, 2025 21:034,450,3921,674,426,2231,645,646,000999,0002,285,568
5Sep 8, 2025 21:034,451,0491,673,768,2611,644,890,0001,998,0002,265,088
6Sep 8, 2025 21:034,451,2811,672,110,1471,644,976,0001,998,0002,285,568
7Sep 8, 2025 21:034,451,5861,670,605,5481,645,089,0001,998,0002,519,040
8Sep 8, 2025 21:034,452,7541,679,151,7061,646,520,000999,0002,285,568
9Sep 8, 2025 21:0311,157,7514,160,736,2644,126,370,0001,998,0002,285,568