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 16:16Victor MerckléVictor MerckléScore: 87,418Success
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 16:1786,65939,668,43125,799,0006,265,0002,113,536
2Jun 18, 2026 16:1786,96239,883,45425,942,0006,234,0002,113,536
3Jun 18, 2026 16:1787,07240,196,46925,914,0006,303,0002,113,536
4Jun 18, 2026 16:1787,33240,330,96525,957,0006,356,0002,113,536
5Jun 18, 2026 16:1787,41840,349,88926,194,0006,151,0002,113,536
6Jun 18, 2026 16:1787,45639,844,94826,255,0006,104,0002,113,536
7Jun 18, 2026 16:1787,81339,979,69726,337,0006,154,0002,113,536
8Jun 18, 2026 16:17648,129247,826,555233,741,0006,067,0002,113,536
9Jun 18, 2026 16:17649,254247,628,353234,039,0006,185,0002,113,536