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 12:39IlyaIlyaScore: 59,035Success
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 12:4458,78131,215,88120,632,0001,117,0002,113,536
2Jul 2, 2026 12:4458,80831,161,53520,647,0001,112,0002,113,536
3Jul 2, 2026 12:4458,86231,200,15320,671,0001,108,0002,113,536
4Jul 2, 2026 12:4458,91331,392,95120,629,0001,169,0002,113,536
5Jul 2, 2026 12:4459,03531,341,15920,654,0001,189,0002,113,536
6Jul 2, 2026 12:4459,17231,384,83920,672,0001,222,0002,113,536
7Jul 2, 2026 12:4459,21031,852,15420,703,0001,205,0002,113,536
8Jul 2, 2026 12:4459,46432,018,96620,738,0001,264,0002,113,536
9Jul 2, 2026 12:4459,54836,375,77620,819,0001,214,0002,113,536