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 30, 2026 05:45limanjun99limanjun99Score: 59,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 05:4559,52746,218,11321,024,0001,001,0002,281,472
2Mar 30, 2026 05:4559,58650,389,24520,043,0002,004,0002,383,872
3Mar 30, 2026 05:4559,83041,925,84821,131,0001,006,0002,281,472