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 12, 2026 00:33Victor MerckléVictor MerckléScore: 64,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 00:3664,34034,634,81522,787,0001,019,0002,113,536
2May 12, 2026 00:3664,58932,917,18022,800,0001,098,0002,113,536
3May 12, 2026 00:3664,65434,105,27522,826,0001,096,0002,113,536
4May 12, 2026 00:3664,74334,238,96222,865,0001,090,0002,113,536
5May 12, 2026 00:3664,75134,330,66822,874,0001,084,0002,113,536
6May 12, 2026 00:3665,07234,684,98722,987,0001,090,0002,113,536
7May 12, 2026 00:3665,12435,075,48922,998,0001,098,0002,113,536
8May 12, 2026 00:3665,46233,469,18523,068,0001,153,0002,113,536
9May 12, 2026 00:3665,97234,084,31623,301,0001,109,0002,113,536