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:39IlyaIlyaScore: 59,059Success
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:4058,90033,084,70220,644,0001,149,0002,113,536
2Jul 7, 2026 13:4058,92431,469,20220,685,0001,117,0002,113,536
3Jul 7, 2026 13:4059,04531,503,44420,732,0001,115,0002,113,536
4Jul 7, 2026 13:4059,05631,544,71620,709,0001,142,0002,113,536
5Jul 7, 2026 13:4059,05931,498,11020,739,0001,113,0002,113,536
6Jul 7, 2026 13:4059,10031,603,97620,702,0001,165,0002,113,536
7Jul 7, 2026 13:4059,10231,505,59720,672,0001,196,0002,113,536
8Jul 7, 2026 13:4059,30831,597,67720,892,0001,052,0002,113,536
9Jul 7, 2026 13:4059,38932,218,32620,746,0001,228,0002,113,536