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 1, 2026 13:28IlyaIlyaScore: 21,660,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 13:3021,553,1277,984,733,6767,822,624,000152,033,0002,113,536
2Jul 1, 2026 13:3021,610,6648,005,575,5057,838,020,000157,926,0002,113,536
3Jul 1, 2026 13:3021,613,6108,007,088,2927,839,713,000157,323,0002,113,536
4Jul 1, 2026 13:3021,624,0248,010,651,9897,844,303,000156,586,0002,113,536
5Jul 1, 2026 13:3021,660,6028,024,489,4837,857,993,000156,430,0002,113,536
6Jul 1, 2026 13:3021,666,7108,026,518,3197,858,630,000158,053,0002,113,536
7Jul 1, 2026 13:3021,678,9548,031,217,5227,865,871,000155,342,0002,113,536
8Jul 1, 2026 13:3021,693,9278,036,844,0287,873,307,000153,446,0002,113,536
9Jul 1, 2026 13:3021,728,6758,049,703,9287,884,088,000155,522,0002,113,536