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 7, 2026 14:14IlyaIlyaScore: 59,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 14:1658,88931,469,65220,690,0001,099,0002,113,536
2Jul 7, 2026 14:1658,90831,462,34520,647,0001,149,0002,113,536
3Jul 7, 2026 14:1658,91331,461,11620,680,0001,118,0002,113,536
4Jul 7, 2026 14:1659,02731,513,04920,722,0001,118,0002,113,536
5Jul 7, 2026 14:1659,04331,464,07020,737,0001,109,0002,113,536
6Jul 7, 2026 14:1659,09431,509,72320,666,0001,199,0002,113,536
7Jul 7, 2026 14:1659,18931,580,30320,783,0001,117,0002,113,536
8Jul 7, 2026 14:1659,20531,670,46420,696,0001,210,0002,113,536
9Jul 7, 2026 14:1661,29441,373,56321,401,0001,278,0002,113,536