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:48Victor MerckléVictor MerckléScore: 67,583Success
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:4967,41033,720,82523,754,0001,188,0002,113,536
2May 11, 2026 15:4967,44033,647,47123,760,0001,193,0002,113,536
3May 11, 2026 15:4967,50535,649,36523,788,0001,189,0002,113,536
4May 11, 2026 15:4967,51036,623,49723,782,0001,197,0002,113,536
5May 11, 2026 15:4967,58333,513,31423,811,0001,195,0002,113,536
6May 11, 2026 15:4967,69733,645,75423,839,0001,209,0002,113,536
7May 11, 2026 15:4967,85933,817,13923,929,0001,179,0002,113,536
8May 11, 2026 15:49190,40879,025,68969,237,0001,214,0002,113,536
9May 11, 2026 15:49191,06780,825,84069,523,0001,172,0002,113,536