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 3, 2026 08:19IlyaIlyaScore: 59,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 08:2059,75131,589,77020,993,0001,115,0002,113,536
2Jul 3, 2026 08:2059,77531,643,81021,012,0001,105,0002,113,536
3Jul 3, 2026 08:2059,83231,704,58621,029,0001,109,0002,113,536
4Jul 3, 2026 08:2059,83731,655,18621,059,0001,081,0002,113,536
5Jul 3, 2026 08:2059,88631,596,65721,043,0001,115,0002,113,536
6Jul 3, 2026 08:2059,94831,716,34221,050,0001,131,0002,113,536
7Jul 3, 2026 08:2059,97831,753,35621,054,0001,138,0002,113,536
8Jul 3, 2026 08:2060,01631,885,27021,070,0001,136,0002,113,536
9Jul 3, 2026 08:2060,21632,346,68621,086,0001,194,0002,113,536