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 listMay 11, 2026 16:44Victor MerckléVictor MerckléScore: 68,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:4568,72435,071,12324,401,0001,027,0002,113,536
2May 11, 2026 16:4568,75134,806,07824,409,0001,029,0002,113,536
3May 11, 2026 16:4568,75134,489,55824,422,0001,016,0002,113,536
4May 11, 2026 16:4568,85134,923,23624,431,0001,044,0002,113,536
5May 11, 2026 16:4568,97035,026,16624,418,0001,101,0002,113,536
6May 11, 2026 16:4569,18637,211,62024,480,0001,119,0002,113,536
7May 11, 2026 16:4569,23235,525,57724,576,0001,040,0002,113,536
8May 11, 2026 16:4569,24036,727,08924,514,0001,105,0002,113,536
9May 11, 2026 16:4569,26735,435,30624,506,0001,123,0002,113,536