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 13:17IlyaIlyaScore: 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 3, 2026 13:2158,84531,271,62920,639,0001,134,0002,113,536
2Jul 3, 2026 13:2158,91031,300,64920,664,0001,133,0002,113,536
3Jul 3, 2026 13:2158,91031,298,28420,696,0001,101,0002,113,536
4Jul 3, 2026 13:2159,04331,317,51320,734,0001,112,0002,113,536
5Jul 3, 2026 13:2159,11331,303,34120,751,0001,121,0002,113,536
6Jul 3, 2026 13:2159,17831,891,08420,679,0001,217,0002,113,536
7Jul 3, 2026 13:2159,18631,343,01820,714,0001,185,0002,113,536
8Jul 3, 2026 13:2159,29131,468,64620,732,0001,206,0002,113,536
9Jul 3, 2026 13:2161,58644,066,19521,500,0001,287,0002,113,536