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 15:23Victor MerckléVictor MerckléScore: 69,200Success
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 15:2468,90036,054,29124,304,0001,189,0002,113,536
2May 11, 2026 15:2468,96435,959,78624,320,0001,197,0002,113,536
3May 11, 2026 15:2469,13736,431,32324,420,0001,161,0002,113,536
4May 11, 2026 15:2469,16434,301,53624,359,0001,232,0002,113,536
5May 11, 2026 15:2469,20034,391,81024,438,0001,166,0002,113,536
6May 11, 2026 15:2469,31634,221,54224,430,0001,217,0002,113,536
7May 11, 2026 15:2469,57234,325,87224,576,0001,166,0002,113,536
8May 11, 2026 15:2469,57837,392,03024,552,0001,192,0002,113,536
9May 11, 2026 15:2469,65934,808,82424,593,0001,181,0002,113,536