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 listApr 19, 2026 08:54olliecrowolliecrowScore: 74,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 08:5474,38655,921,12826,504,0001,019,0002,297,856
2Apr 19, 2026 08:5474,47353,583,76127,555,00002,297,856
3Apr 19, 2026 08:5474,65753,875,58925,650,0001,973,0002,293,760