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:42A_ShamanA_ShamanScore: 70,467Success
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:4370,11835,509,04324,851,0001,093,0002,113,536
2Jul 2, 2026 23:4370,23735,619,35124,825,0001,163,0002,113,536
3Jul 2, 2026 23:4370,36236,040,95524,850,0001,184,0002,113,536
4Jul 2, 2026 23:4370,36736,031,15024,840,0001,196,0002,113,536
5Jul 2, 2026 23:4370,46735,579,25324,910,0001,163,0002,113,536
6Jul 2, 2026 23:4370,49736,077,33324,895,0001,189,0002,113,536
7Jul 2, 2026 23:4370,60236,117,00024,952,0001,171,0002,113,536
8Jul 2, 2026 23:4370,76436,221,83324,971,0001,212,0002,113,536
9Jul 2, 2026 23:4370,99136,292,05925,224,0001,043,0002,113,536