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 16:55Victor MerckléVictor MerckléScore: 63,659Success
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 16:5663,17830,803,88622,371,0001,005,0002,113,536
2Jun 24, 2026 16:5663,44530,882,93922,455,0001,020,0002,113,536
3Jun 24, 2026 16:5663,55431,568,46922,500,0001,015,0002,113,536
4Jun 24, 2026 16:5663,60531,195,15422,530,0001,004,0002,113,536
5Jun 24, 2026 16:5663,65931,083,69022,544,0001,010,0002,113,536
6Jun 24, 2026 16:5663,74831,198,36122,564,0001,023,0002,113,536
7Jun 24, 2026 16:5663,87831,238,48422,625,0001,010,0002,113,536
8Jun 24, 2026 16:5664,03231,806,45422,688,0001,004,0002,113,536
9Jun 24, 2026 16:5664,13731,746,58522,607,0001,124,0002,113,536