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:03IlyaIlyaScore: 58,856Success
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:0558,48931,380,29120,434,0001,207,0002,113,536
2Jul 12, 2026 19:0558,63533,301,18720,576,0001,119,0002,113,536
3Jul 12, 2026 19:0558,70531,674,94520,524,0001,197,0002,113,536
4Jul 12, 2026 19:0558,84832,016,76020,535,0001,239,0002,113,536
5Jul 12, 2026 19:0558,85631,459,94320,686,0001,091,0002,113,536
6Jul 12, 2026 19:0558,88132,059,12320,544,0001,242,0002,113,536
7Jul 12, 2026 19:0521,553,5677,985,101,1367,825,380,000149,440,0002,113,536
8Jul 12, 2026 19:0521,616,4138,007,877,4657,846,870,000151,203,0002,113,536
9Jul 12, 2026 19:0521,658,5628,024,061,3357,863,293,000150,375,0002,113,536