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 03:53limanjun99limanjun99Score: 68,695Success
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 03:5368,62449,282,02023,360,0002,031,0002,396,160
2Mar 30, 2026 03:5368,69553,022,21625,417,00002,281,472
3Mar 30, 2026 03:5368,98648,036,99225,525,00002,281,472