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 listSep 21, 2025 08:35CemaCemaScore: 816,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2025 08:35797,051320,240,918293,910,000999,0002,506,752
2Sep 21, 2025 08:35816,919332,280,593301,260,0001,000,0002,510,848
3Sep 21, 2025 08:35840,389338,696,999309,945,000999,0002,506,752