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 2, 2026 23:13A_ShamanA_ShamanScore: 73,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 23:1372,88336,570,09225,922,0001,045,0002,113,536
2Jul 2, 2026 23:1372,97536,520,57925,951,0001,050,0002,113,536
3Jul 2, 2026 23:1373,01337,041,39825,964,0001,051,0002,113,536
4Jul 2, 2026 23:1373,08637,050,26725,992,0001,050,0002,113,536
5Jul 2, 2026 23:1373,11037,006,54026,001,0001,050,0002,113,536
6Jul 2, 2026 23:1373,22436,985,55026,044,0001,049,0002,113,536
7Jul 2, 2026 23:1373,36437,149,61726,096,0001,049,0002,113,536
8Jul 2, 2026 23:1373,37237,157,53526,097,0001,051,0002,113,536
9Jul 2, 2026 23:1373,54337,242,28626,156,0001,055,0002,113,536