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 22:24Victor MerckléVictor MerckléScore: 64,570Success
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 22:2664,34332,556,46722,791,0001,016,0002,113,536
2May 11, 2026 22:2664,42934,473,38422,794,0001,045,0002,113,536
3May 11, 2026 22:2664,46732,548,94022,824,0001,029,0002,113,536
4May 11, 2026 22:2664,50233,410,27422,782,0001,084,0002,113,536
5May 11, 2026 22:2664,57033,807,16122,791,0001,100,0002,113,536
6May 11, 2026 22:2664,70035,510,51022,849,0001,090,0002,113,536
7May 11, 2026 22:2664,86432,685,86822,984,0001,016,0002,113,536
8May 11, 2026 22:2664,91332,802,93122,964,0001,054,0002,113,536
9May 11, 2026 22:2664,91834,712,79222,996,0001,024,0002,113,536