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 24, 2026 11:47Victor MerckléVictor MerckléScore: 63,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 11:4862,49430,571,50023,123,00002,113,536
2Jun 24, 2026 11:4863,35431,228,01823,441,00002,113,536
3Jun 24, 2026 11:4863,56731,562,24822,515,0001,005,0002,113,536
4Jun 24, 2026 11:4863,63532,922,17122,541,0001,004,0002,113,536
5Jun 24, 2026 11:4863,74831,604,46322,580,0001,007,0002,113,536
6Jun 24, 2026 11:4863,81031,049,51222,598,0001,012,0002,113,536
7Jun 24, 2026 11:4863,84031,697,51422,616,0001,005,0002,113,536
8Jun 24, 2026 11:4863,87031,032,81723,632,00002,113,536
9Jun 24, 2026 11:4863,95631,697,47622,640,0001,024,0002,113,536