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 listApr 26, 2026 04:19Charles CabergsCharles CabergsScore: 71,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 04:2070,84343,867,81124,196,0002,016,0002,355,200
2Apr 26, 2026 04:2070,86745,675,14425,213,0001,008,0002,363,392
3Apr 26, 2026 04:2070,93739,963,69625,238,0001,009,0002,359,296
4Apr 26, 2026 04:2070,95645,613,08925,245,0001,009,0002,310,144
5Apr 26, 2026 04:2071,21643,125,21125,337,0001,013,0002,355,200
6Apr 26, 2026 04:2071,22941,137,99425,342,0001,013,0002,351,104
7Apr 26, 2026 04:2071,24041,543,49325,346,0001,013,0002,428,928
8Apr 26, 2026 04:2071,34346,493,98425,382,0001,015,0002,355,200
9Apr 26, 2026 04:2071,38948,357,03126,414,00002,363,392