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 3, 2026 11:09IlyaIlyaScore: 60,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 11:1260,22931,861,27921,168,0001,117,0002,113,536
2Jul 3, 2026 11:1260,29131,824,47021,195,0001,113,0002,113,536
3Jul 3, 2026 11:1260,42131,866,84521,261,0001,095,0002,113,536
4Jul 3, 2026 11:1260,49432,261,75121,245,0001,138,0002,113,536
5Jul 3, 2026 11:1260,51831,870,76421,264,0001,128,0002,117,632
6Jul 3, 2026 11:1260,58331,905,46021,210,0001,206,0002,113,536
7Jul 3, 2026 11:1260,74032,486,21521,232,0001,242,0002,113,536
8Jul 3, 2026 11:1260,74331,981,53021,357,0001,118,0002,113,536
9Jul 3, 2026 11:1260,75132,432,30821,263,0001,215,0002,113,536