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 24, 2026 22:58Victor MerckléVictor MerckléScore: 73,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 22:5872,92136,097,02925,707,0001,274,0002,117,632stderr
2Jun 24, 2026 22:5872,94836,127,80425,714,0001,277,0002,117,632stderr
3Jun 24, 2026 22:5872,95436,047,74425,735,0001,258,0002,117,632stderr
4Jun 24, 2026 22:5873,05936,145,05825,755,0001,277,0002,117,632stderr
5Jun 24, 2026 22:5873,05936,149,12825,767,0001,265,0002,117,632stderr
6Jun 24, 2026 22:5873,10036,238,63925,766,0001,281,0002,117,632stderr
7Jun 24, 2026 22:5873,38336,239,27625,875,0001,277,0002,117,632stderr
8Jun 24, 2026 22:5873,43736,353,39225,889,0001,283,0002,117,632stderr
9Jun 24, 2026 22:5873,46436,343,07825,900,0001,282,0002,117,632stderr