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 12, 2026 19:19IlyaIlyaScore: 58,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 19:2158,26231,192,69420,435,0001,122,0002,113,536
2Jul 12, 2026 19:2158,32431,183,28020,458,0001,122,0002,113,536
3Jul 12, 2026 19:2158,34331,215,61820,482,0001,105,0002,113,536
4Jul 12, 2026 19:2158,45131,336,06120,497,0001,130,0002,113,536
5Jul 12, 2026 19:2158,45931,296,64020,526,0001,104,0002,113,536
6Jul 12, 2026 19:2158,57531,315,29820,648,0001,025,0002,113,536
7Jul 12, 2026 19:2158,69731,980,61220,510,0001,208,0002,113,536
8Jul 12, 2026 19:2158,78632,051,24320,498,0001,253,0002,113,536
9Jul 12, 2026 19:2121,749,2438,057,688,6647,895,197,000152,023,0002,113,536