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 13:37IlyaIlyaScore: 59,202Success
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 13:3858,81631,438,66420,640,0001,122,0002,113,536
2Jul 7, 2026 13:3858,94531,497,84820,670,0001,140,0002,113,536
3Jul 7, 2026 13:3859,13731,524,01120,766,0001,115,0002,113,536
4Jul 7, 2026 13:3859,14531,569,28920,743,0001,141,0002,113,536
5Jul 7, 2026 13:3859,20231,637,81820,698,0001,207,0002,113,536
6Jul 7, 2026 13:3859,26432,229,66020,686,0001,242,0002,113,536
7Jul 7, 2026 13:3859,35631,613,32520,680,0001,282,0002,113,536
8Jul 7, 2026 13:3859,36231,597,86820,707,0001,257,0002,113,536
9Jul 7, 2026 13:3859,50831,620,91620,801,0001,217,0002,113,536