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 listMar 20, 2026 18:15olliecrowolliecrowScore: 102,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 18:15100,94960,476,78334,323,0003,028,0002,449,408
2Mar 20, 2026 18:16101,42459,603,89235,499,0002,028,0002,297,856
3Mar 20, 2026 18:16102,31965,049,32135,866,0001,992,0002,330,624
4Mar 20, 2026 18:15102,33263,347,90035,817,0002,046,0002,445,312
5Mar 20, 2026 18:15102,75963,220,42236,020,0002,001,0002,433,024
6Mar 20, 2026 18:16102,87366,876,32636,060,0002,003,0002,441,216