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 8, 2026 21:10IlyaIlyaScore: 59,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 21:1258,95132,843,15320,688,0001,124,0002,113,536
2Jul 8, 2026 21:1259,05131,585,90020,679,0001,170,0002,113,536
3Jul 8, 2026 21:1259,06731,539,91420,745,0001,110,0002,113,536
4Jul 8, 2026 21:1259,09431,546,67520,743,0001,122,0002,113,536
5Jul 8, 2026 21:1259,15431,595,98420,769,0001,118,0002,113,536
6Jul 8, 2026 21:1259,15431,574,31520,789,0001,098,0002,113,536
7Jul 8, 2026 21:1259,27531,622,06020,780,0001,152,0002,113,536
8Jul 8, 2026 21:1259,29131,674,45720,778,0001,160,0002,113,536
9Jul 8, 2026 21:1259,34831,699,45220,756,0001,203,0002,113,536