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 21, 2026 23:34Dominique GarmierDominique GarmierScore: 343,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 23:34341,068151,876,030125,194,0001,001,0002,375,680
2Mar 21, 2026 23:34343,659152,794,264123,150,0004,004,0002,281,472
3Mar 21, 2026 23:34343,773154,106,184124,192,0003,004,0002,306,048