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 13:47IlyaIlyaScore: 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
1Jul 7, 2026 13:5058,78631,470,78620,646,0001,105,0002,113,536
2Jul 7, 2026 13:5058,85431,380,77220,658,0001,118,0002,113,536
3Jul 7, 2026 13:5058,94331,585,90920,694,0001,115,0002,113,536
4Jul 7, 2026 13:5058,99131,638,56120,652,0001,175,0002,113,536
5Jul 7, 2026 13:5059,00531,480,37520,669,0001,163,0002,113,536
6Jul 7, 2026 13:5059,05131,550,74120,701,0001,148,0002,113,536
7Jul 7, 2026 13:5059,28931,597,28720,754,0001,183,0002,113,536
8Jul 7, 2026 13:5059,37232,195,48920,780,0001,188,0002,113,536
9Jul 7, 2026 13:5059,38331,574,40220,771,0001,201,0002,113,536