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 10:57Victor MerckléVictor MerckléScore: 86,281Success
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 10:5885,70539,536,04322,587,0009,124,0002,113,536
2Jun 24, 2026 10:5885,92939,676,08622,691,0009,103,0002,113,536
3Jun 24, 2026 10:5886,26239,386,14122,759,0009,158,0002,113,536
4Jun 24, 2026 10:5886,27839,361,51923,396,0008,527,0002,113,536
5Jun 24, 2026 10:5886,28139,361,53022,758,0009,166,0002,113,536
6Jun 24, 2026 10:5887,51639,847,78422,679,0009,702,0002,113,536
7Jun 24, 2026 10:5887,74839,951,81722,697,0009,770,0002,113,536
8Jun 24, 2026 10:5887,80839,965,06622,670,0009,819,0002,113,536
9Jun 24, 2026 10:5887,88141,915,55222,758,0009,758,0002,113,536