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 01:22Victor MerckléVictor MerckléScore: 64,686Success
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 01:2364,44332,625,51522,842,0001,002,0002,113,536
2May 12, 2026 01:2364,47532,679,60322,836,0001,020,0002,113,536
3May 12, 2026 01:2364,51333,464,65122,784,0001,086,0002,113,536
4May 12, 2026 01:2364,59734,274,47622,803,0001,098,0002,113,536
5May 12, 2026 01:2364,68632,669,19322,846,0001,088,0002,113,536
6May 12, 2026 01:2364,86733,837,19722,979,0001,022,0002,113,536
7May 12, 2026 01:2364,86734,629,49122,982,0001,019,0002,113,536
8May 12, 2026 01:2364,94032,777,12822,961,0001,067,0002,113,536
9May 12, 2026 01:2365,11334,447,75122,995,0001,097,0002,113,536