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 14:46Andrew EpsteinAndrew EpsteinScore: 55,932Success
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 14:4754,48328,930,98019,141,0001,018,0002,113,536
2Sep 20, 2026 14:4755,10829,220,13919,350,0001,040,0002,113,536
3Sep 20, 2026 14:4755,11829,157,31919,352,0001,042,0002,113,536
4Sep 20, 2026 14:4755,74030,098,59119,605,0001,019,0002,113,536
5Sep 20, 2026 14:4755,93230,071,85419,658,0001,037,0002,113,536
6Sep 20, 2026 14:4756,44529,623,81420,885,00002,113,536
7Sep 20, 2026 14:4756,50829,646,21219,873,0001,035,0002,113,536
8Sep 20, 2026 14:4756,73730,428,92219,959,0001,034,0002,113,536
9Sep 20, 2026 14:4756,77829,770,13219,952,0001,056,0002,113,536