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 18, 2026 05:44Victor MerckléVictor MerckléScore: 86,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 05:4583,86438,637,82922,413,0008,617,0002,113,536
2Jun 18, 2026 05:4585,04338,847,76622,611,0008,855,0002,113,536
3Jun 18, 2026 05:4585,25938,976,11822,605,0008,941,0002,113,536
4Jun 18, 2026 05:4585,29139,175,33223,112,0008,446,0002,113,536
5Jun 18, 2026 05:4586,21839,492,37822,538,0009,363,0002,113,536
6Jun 18, 2026 05:4586,26239,887,69222,586,0009,331,0002,113,536
7Jun 18, 2026 05:4586,88340,083,90122,694,0009,453,0002,113,536
8Jun 18, 2026 05:45172,02171,015,90954,939,0008,709,0002,113,536
9Jun 18, 2026 05:45174,24872,388,86855,583,0008,889,0002,113,536