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 17:53olliecrowolliecrowScore: 102,911Success
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 17:53100,92461,158,07935,324,0002,018,0002,437,120
2Mar 20, 2026 17:53102,91169,494,32435,071,0003,006,0002,342,912
3Mar 20, 2026 17:53110,44181,817,36739,816,0001,047,0002,338,816