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 23, 2026 07:01Dominique GarmierDominique GarmierScore: 343,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 07:01342,449152,801,220124,711,0001,995,0002,367,488
2Mar 23, 2026 07:01343,462151,797,610125,080,0002,001,0002,310,144
3Mar 23, 2026 07:01343,643156,680,604125,146,0002,002,0002,273,280