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 listJul 7, 2026 14:05IlyaIlyaScore: 59,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 14:0658,90831,426,08320,599,0001,197,0002,113,536
2Jul 7, 2026 14:0659,12131,460,42620,741,0001,134,0002,113,536
3Jul 7, 2026 14:0659,15631,506,76620,855,0001,033,0002,113,536
4Jul 7, 2026 14:0659,21331,547,95620,716,0001,193,0002,113,536
5Jul 7, 2026 14:0659,22431,548,22820,707,0001,206,0002,113,536
6Jul 7, 2026 14:0659,22931,476,62220,722,0001,193,0002,113,536
7Jul 7, 2026 14:0659,26231,674,73020,717,0001,210,0002,113,536
8Jul 7, 2026 14:0659,60832,112,61220,960,0001,095,0002,113,536
9Jul 7, 2026 14:0661,69744,290,93221,532,0001,296,0002,113,536