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:45Victor MerckléVictor MerckléScore: 64,400Success
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:4663,86232,665,38122,514,0001,115,0002,117,632stderr
2Jun 10, 2026 13:4663,92732,688,48022,536,0001,117,0002,117,632stderr
3Jun 10, 2026 13:4663,96732,721,60722,538,0001,130,0002,117,632stderr
4Jun 10, 2026 13:4664,04832,817,88222,575,0001,123,0002,117,632stderr
5Jun 10, 2026 13:4664,40032,862,59022,706,0001,122,0002,117,632stderr
6Jun 10, 2026 13:4664,68632,969,63222,799,0001,135,0002,117,632stderr
7Jun 10, 2026 13:4664,75632,984,72322,830,0001,130,0002,117,632stderr
8Jun 10, 2026 13:4664,90533,017,05922,881,0001,134,0002,117,632stderr
9Jun 10, 2026 13:4665,07033,139,96422,963,0001,113,0002,117,632stderr