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 8, 2026 17:38IlyaIlyaScore: 59,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 17:3959,07831,483,77520,745,0001,114,0002,113,536
2Jul 8, 2026 17:3959,37231,633,96620,767,0001,201,0002,113,536
3Jul 8, 2026 17:3959,41031,656,86720,829,0001,153,0002,113,536
4Jul 8, 2026 17:3959,46431,658,85920,803,0001,199,0002,113,536
5Jul 8, 2026 17:3959,56432,235,59320,823,0001,216,0002,113,536
6Jul 8, 2026 17:3959,62431,889,15420,825,0001,236,0002,113,536
7Jul 8, 2026 17:3959,70232,325,40720,883,0001,207,0002,113,536
8Jul 8, 2026 17:3959,70532,503,29020,837,0001,254,0002,113,536
9Jul 8, 2026 17:3959,79140,973,02320,971,0001,152,0002,113,536