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 listSep 20, 2026 14:41Andrew EpsteinAndrew EpsteinScore: 57,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2026 14:4257,38330,030,00420,222,0001,010,0002,113,536
2Sep 20, 2026 14:4257,40230,706,55620,222,0001,017,0002,113,536
3Sep 20, 2026 14:4257,43529,999,71420,248,0001,003,0002,113,536
4Sep 20, 2026 14:4257,48130,084,67720,225,0001,043,0002,113,536
5Sep 20, 2026 14:4257,50030,683,56020,230,0001,045,0002,113,536
6Sep 20, 2026 14:4257,54330,327,83620,285,0001,006,0002,113,536
7Sep 20, 2026 14:4257,56430,074,20920,285,0001,014,0002,113,536
8Sep 20, 2026 14:4257,57530,078,59120,297,0001,006,0002,113,536
9Sep 20, 2026 14:4257,80830,163,39320,257,0001,132,0002,113,536