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 listJun 10, 2026 13:24Victor MerckléVictor MerckléScore: 71,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 13:2470,63735,170,72825,010,0001,126,0002,117,632stderr
2Jun 10, 2026 13:2470,84835,240,56025,091,0001,123,0002,117,632stderr
3Jun 10, 2026 13:2470,86435,231,16325,095,0001,125,0002,117,632stderr
4Jun 10, 2026 13:2471,24835,372,93825,243,0001,119,0002,117,632stderr
5Jun 10, 2026 13:2471,46235,497,65225,313,0001,128,0002,117,632stderr
6Jun 10, 2026 13:2471,57535,564,91825,365,0001,118,0002,117,632stderr
7Jun 10, 2026 13:2471,71835,569,67625,422,0001,114,0002,117,632stderr
8Jun 10, 2026 13:2471,72736,329,65525,408,0001,131,0002,117,632stderr
9Jun 10, 2026 13:2471,97535,680,23225,506,0001,125,0002,117,632stderr