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:02Victor MerckléVictor MerckléScore: 71,170Success
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:0371,07035,467,36825,037,0001,259,0002,113,536
2Jun 24, 2026 22:0371,08135,422,75025,040,0001,260,0002,113,536
3Jun 24, 2026 22:0371,14835,526,80725,063,0001,262,0002,113,536
4Jun 24, 2026 22:0371,15135,473,92225,067,0001,259,0002,113,536
5Jun 24, 2026 22:0371,17035,468,54425,060,0001,273,0002,113,536
6Jun 24, 2026 22:0371,18635,459,27925,085,0001,254,0002,113,536
7Jun 24, 2026 22:0371,43235,558,32925,176,0001,254,0002,113,536
8Jun 24, 2026 22:0371,45136,756,48325,418,0001,019,0002,113,536
9Jun 24, 2026 22:0371,46235,574,78325,169,0001,272,0002,113,536