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 12:13Victor MerckléVictor MerckléScore: 64,432Success
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 12:1464,05932,637,47922,690,0001,012,0002,117,632stderr
2Jun 10, 2026 12:1464,22432,789,94022,746,0001,017,0002,117,632stderr
3Jun 10, 2026 12:1464,29132,799,75122,707,0001,081,0002,117,632stderr
4Jun 10, 2026 12:1464,31832,810,79822,713,0001,085,0002,117,632stderr
5Jun 10, 2026 12:1464,43233,245,26322,754,0001,086,0002,117,632stderr
6Jun 10, 2026 12:1464,82433,276,94322,897,0001,088,0002,117,632stderr
7Jun 10, 2026 12:1464,82733,028,44422,903,0001,083,0002,117,632stderr
8Jun 10, 2026 12:1464,83533,037,65222,975,0001,014,0002,117,632stderr
9Jun 10, 2026 12:14618,210238,349,356227,650,0001,088,0002,117,632stderr