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 12:18IlyaIlyaScore: 59,505Success
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 12:1959,19731,481,54620,740,0001,163,0002,113,536
2Jul 2, 2026 12:1959,37831,519,58420,772,0001,198,0002,113,536
3Jul 2, 2026 12:1959,43732,057,43320,783,0001,209,0002,113,536
4Jul 2, 2026 12:1959,47032,047,00920,823,0001,181,0002,113,536
5Jul 2, 2026 12:1959,50531,992,66620,811,0001,206,0002,113,536
6Jul 2, 2026 12:1959,55132,047,20920,830,0001,204,0002,113,536
7Jul 2, 2026 12:1959,60232,105,93420,855,0001,198,0002,113,536
8Jul 2, 2026 12:1959,63532,034,93120,861,0001,204,0002,113,536
9Jul 2, 2026 12:1960,11831,825,18521,163,0001,081,0002,113,536