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 20:29Victor MerckléVictor MerckléScore: 64,791Success
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 20:3164,45132,689,95122,829,0001,018,0002,113,536
2May 11, 2026 20:3164,58134,694,74722,842,0001,053,0002,113,536
3May 11, 2026 20:3164,69134,732,79022,893,0001,043,0002,113,536
4May 11, 2026 20:3164,77833,380,83522,851,0001,117,0002,113,536
5May 11, 2026 20:3164,79132,749,21222,936,0001,037,0002,113,536
6May 11, 2026 20:3164,98135,506,70423,016,0001,027,0002,113,536
7May 11, 2026 20:3165,23733,042,35823,041,0001,097,0002,113,536
8May 11, 2026 20:3165,24332,929,88323,049,0001,091,0002,113,536
9May 11, 2026 20:3167,28148,886,99123,752,0001,142,0002,113,536