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 6, 2026 10:41olliecrowolliecrowScore: 61,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 10:4161,05943,359,70321,566,0001,026,0002,273,280
2Mar 6, 2026 10:4161,08652,823,94421,575,0001,027,0002,273,280
3Mar 6, 2026 10:4161,34153,580,69321,665,0001,031,0002,273,280
4Mar 6, 2026 10:4161,36246,270,66321,672,0001,032,0002,273,280
5Mar 6, 2026 10:4161,43050,342,93021,696,0001,033,0002,404,352
6Mar 6, 2026 10:4161,73240,749,06721,848,000993,0002,273,280
7Mar 6, 2026 10:4161,73553,856,07520,856,0001,986,0002,392,064
8Mar 6, 2026 10:4161,75751,226,44321,857,000993,0002,273,280
9Mar 6, 2026 10:4161,77651,660,83520,870,0001,987,0002,486,272