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 10:22IlyaIlyaScore: 59,113Success
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 10:2358,76431,385,81120,637,0001,106,0002,113,536
2Jul 8, 2026 10:2358,95431,432,01220,679,0001,134,0002,113,536
3Jul 8, 2026 10:2359,01631,410,82620,709,0001,127,0002,113,536
4Jul 8, 2026 10:2359,06231,989,49720,734,0001,119,0002,113,536
5Jul 8, 2026 10:2359,11331,524,17220,741,0001,131,0002,113,536
6Jul 8, 2026 10:2359,15132,110,17120,684,0001,202,0002,113,536
7Jul 8, 2026 10:2359,28632,255,13020,730,0001,206,0002,113,536
8Jul 8, 2026 10:2359,35632,276,16920,719,0001,243,0002,113,536
9Jul 8, 2026 10:2359,51632,275,86620,775,0001,246,0002,113,536