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 listOct 20, 2026 09:10e1011e1011Score: 86,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 09:1285,51642,539,08630,442,0001,199,0002,113,536
2Oct 20, 2026 09:1285,51842,550,82230,528,0001,114,0002,113,536
3Oct 20, 2026 09:1285,75644,608,75530,534,0001,196,0002,113,536
4Oct 20, 2026 09:1285,87242,785,22130,590,0001,183,0002,113,536
5Oct 20, 2026 09:1286,12142,502,38230,673,0001,192,0002,113,536
6Oct 20, 2026 09:1286,82443,330,24230,914,0001,211,0002,113,536
7Oct 20, 2026 09:1287,05143,102,32931,099,0001,110,0002,113,536
8Oct 20, 2026 09:1287,40543,212,53531,151,0001,189,0002,113,536
9Oct 20, 2026 09:1288,52955,202,24231,529,0001,227,0002,113,536