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:07olliecrowolliecrowScore: 102,916Success
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:07101,29557,347,43036,467,0001,012,0002,453,504
2Mar 20, 2026 17:07102,91663,514,70935,073,0003,006,0002,342,912
3Mar 20, 2026 17:07108,38688,969,86837,096,0003,007,0002,342,912