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:30Victor MerckléVictor MerckléScore: 72,543Success
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:3172,08935,674,63525,563,0001,110,0002,117,632stderr
2Jun 10, 2026 13:3172,24536,890,32625,594,0001,137,0002,117,632stderr
3Jun 10, 2026 13:3172,30835,811,54825,744,0001,010,0002,117,632stderr
4Jun 10, 2026 13:3172,39135,905,89725,655,0001,130,0002,117,632stderr
5Jun 10, 2026 13:3172,54335,883,53725,747,0001,094,0002,117,632stderr
6Jun 10, 2026 13:3172,61335,947,19525,735,0001,132,0002,117,632stderr
7Jun 10, 2026 13:3173,08336,151,59725,899,0001,142,0002,117,632stderr
8Jun 10, 2026 13:3173,20836,163,39925,970,0001,117,0002,117,632stderr
9Jun 10, 2026 13:31159,97868,199,85458,083,0001,109,0002,117,632stderr