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 7, 2026 14:07IlyaIlyaScore: 59,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 14:0858,88331,367,80520,628,0001,159,0002,113,536
2Jul 7, 2026 14:0859,10831,509,39220,766,0001,104,0002,113,536
3Jul 7, 2026 14:0859,12738,203,49620,744,0001,133,0002,113,536
4Jul 7, 2026 14:0859,21332,080,29120,778,0001,131,0002,113,536
5Jul 7, 2026 14:0859,22431,528,78120,790,0001,123,0002,113,536
6Jul 7, 2026 14:0859,24031,498,59020,747,0001,172,0002,113,536
7Jul 7, 2026 14:0859,28932,152,23220,745,0001,192,0002,113,536
8Jul 7, 2026 14:0859,37031,714,28120,687,0001,280,0002,113,536
9Jul 7, 2026 14:0859,53232,316,08520,771,0001,256,0002,113,536