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 13:36Victor MerckléVictor MerckléScore: 124,194Success
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 13:38122,72753,084,96045,409,00002,117,632stderr
2Jun 24, 2026 13:38122,90253,138,28145,474,00002,117,632stderr
3Jun 24, 2026 13:38123,70053,479,50344,754,0001,015,0002,117,632stderr
4Jun 24, 2026 13:38123,99753,888,76444,871,0001,008,0002,117,632stderr
5Jun 24, 2026 13:38124,19453,374,51745,952,00002,117,632stderr
6Jun 24, 2026 13:38124,22753,966,27545,964,00002,117,632stderr
7Jun 24, 2026 13:38124,38654,059,67846,023,00002,117,632stderr
8Jun 24, 2026 13:38124,68353,800,23845,125,0001,008,0002,117,632stderr
9Jun 24, 2026 13:38125,15153,901,13745,300,0001,006,0002,117,632stderr