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:14IlyaIlyaError
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:19058,969,95546,946,0001,088,0002,113,536expected "429496449588 ", got "429496467042 "
2Jul 3, 2026 11:19057,687,40346,989,0001,095,0002,113,536expected "429496537685 ", got "429496545438 "
3Jul 3, 2026 11:1960,45431,970,16121,210,0001,158,0002,113,536
4Jul 3, 2026 11:1960,48331,933,18021,246,0001,133,0002,113,536
5Jul 3, 2026 11:1960,56231,826,28621,294,0001,114,0002,113,536
6Jul 3, 2026 11:1960,57232,416,50721,212,0001,200,0002,113,536
7Jul 3, 2026 11:1960,71031,948,50421,334,0001,129,0002,113,536
8Jul 3, 2026 11:1960,74832,519,55521,270,0001,207,0002,113,536
9Jul 3, 2026 11:1960,97232,586,08321,321,0001,239,0002,113,536