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 20, 2026 15:00Andrew EpsteinAndrew EpsteinScore: 56,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2026 15:0156,39729,692,65720,867,00002,113,536
2Sep 20, 2026 15:0156,49129,690,94620,902,00002,113,536
3Sep 20, 2026 15:0156,54329,727,24019,915,0001,006,0002,113,536
4Sep 20, 2026 15:0156,57029,791,05919,883,0001,048,0002,113,536
5Sep 20, 2026 15:0156,58931,011,78419,933,0001,005,0002,113,536
6Sep 20, 2026 15:0156,62929,762,78819,949,0001,004,0002,113,536
7Sep 20, 2026 15:0156,64529,800,26220,959,00002,113,536
8Sep 20, 2026 15:0156,74829,884,29119,950,0001,047,0002,113,536
9Sep 20, 2026 15:0156,82429,852,85120,005,0001,020,0002,113,536