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 listJun 30, 2026 07:44IlyaIlyaScore: 59,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 07:4558,82131,572,05020,577,0001,187,0002,113,536
2Jun 30, 2026 07:4558,82431,219,13120,650,0001,115,0002,113,536
3Jun 30, 2026 07:4558,95131,296,99120,690,0001,122,0002,113,536
4Jun 30, 2026 07:4558,98331,270,39820,695,0001,129,0002,113,536
5Jun 30, 2026 07:4559,00531,886,69420,648,0001,184,0002,113,536
6Jun 30, 2026 07:4559,03531,798,41920,646,0001,197,0002,113,536
7Jun 30, 2026 07:4559,04831,569,64420,677,0001,171,0002,113,536
8Jun 30, 2026 07:4559,10831,824,32220,689,0001,181,0002,113,536
9Jun 30, 2026 07:4559,29131,904,81720,730,0001,208,0002,113,536