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 listJun 30, 2026 18:14IlyaIlyaScore: 59,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 18:1558,75431,219,49120,641,0001,098,0002,113,536
2Jun 30, 2026 18:1558,87531,735,30020,676,0001,108,0002,113,536
3Jun 30, 2026 18:1558,87831,260,60220,609,0001,176,0002,113,536
4Jun 30, 2026 18:1558,88931,292,31020,693,0001,096,0002,113,536
5Jun 30, 2026 18:1559,04531,419,01520,655,0001,192,0002,113,536
6Jun 30, 2026 18:1559,06731,418,53120,645,0001,210,0002,113,536
7Jun 30, 2026 18:1559,09131,291,36320,679,0001,185,0002,113,536
8Jun 30, 2026 18:1559,10531,842,09320,731,0001,138,0002,113,536
9Jun 30, 2026 18:1559,90532,149,41720,962,0001,203,0002,113,536