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 16, 2026 07:09M-RochatM-RochatScore: 74,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 07:1074,49436,958,49926,291,0001,272,0002,113,536
2May 16, 2026 07:1074,72136,424,29826,614,0001,033,0002,113,536
3May 16, 2026 07:1074,73536,464,22026,390,0001,262,0002,113,536
4May 16, 2026 07:1074,77036,990,42326,384,0001,281,0002,113,536
5May 16, 2026 07:1074,78337,013,44326,389,0001,281,0002,113,536
6May 16, 2026 07:1074,82936,434,64126,656,0001,031,0002,113,536
7May 16, 2026 07:1074,99737,736,33026,729,0001,020,0002,113,536
8May 16, 2026 07:1075,18337,579,61126,792,0001,026,0002,113,536
9May 16, 2026 07:1075,18636,569,22926,533,0001,286,0002,113,536