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 listMar 30, 2026 16:20Dominique GarmierDominique GarmierScore: 70,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 16:2070,62452,039,46925,126,0001,005,0002,363,392
2Mar 30, 2026 15:0770,63552,321,11025,130,0001,005,0002,363,392
3Mar 30, 2026 15:0770,76850,373,08625,177,0001,007,0002,367,488
4Mar 30, 2026 16:2070,88948,481,25024,212,0002,017,0002,363,392
5Mar 30, 2026 15:0771,00553,231,21025,262,0001,010,0002,469,888
6Mar 30, 2026 16:2071,05954,112,81725,281,0001,011,0002,359,296