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 listMay 11, 2026 23:38Victor MerckléVictor MerckléScore: 65,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 23:3964,81033,484,33022,963,0001,017,0002,113,536
2May 11, 2026 23:3964,83534,203,42322,973,0001,016,0002,113,536
3May 11, 2026 23:3964,92733,227,94423,013,0001,010,0002,113,536
4May 11, 2026 23:3964,98332,981,84123,034,0001,010,0002,113,536
5May 11, 2026 23:3965,14334,246,12723,012,0001,091,0002,113,536
6May 11, 2026 23:3965,29135,156,63323,047,0001,111,0002,113,536
7May 11, 2026 23:3965,47534,643,90523,162,0001,064,0002,113,536
8May 11, 2026 23:3965,61633,995,96423,187,0001,091,0002,113,536
9May 11, 2026 23:3965,68934,747,09923,206,0001,099,0002,113,536