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 18, 2026 03:25M-RochatM-RochatScore: 59,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 03:2659,63231,749,18920,995,0001,069,0002,113,536
2May 18, 2026 03:2659,71631,625,62721,015,0001,080,0002,113,536
3May 18, 2026 03:2659,85934,288,16320,987,0001,161,0002,113,536
4May 18, 2026 03:2659,89432,055,28021,019,0001,142,0002,113,536
5May 18, 2026 03:2659,92932,560,57621,004,0001,170,0002,113,536
6May 18, 2026 03:2659,95133,228,31521,098,0001,084,0002,113,536
7May 18, 2026 03:2659,98333,229,43321,095,0001,099,0002,113,536
8May 18, 2026 03:2660,04832,002,41221,065,0001,153,0002,113,536
9May 18, 2026 03:2660,48333,658,77621,200,0001,179,0002,113,536