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 listJun 30, 2026 10:45IlyaIlyaScore: 60,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 10:4660,59731,895,55921,303,0001,118,0002,113,536
2Jun 30, 2026 10:4660,78331,947,01921,399,0001,091,0002,113,536
3Jun 30, 2026 10:4660,82932,388,39221,401,0001,106,0002,113,536
4Jun 30, 2026 10:4660,85431,962,43121,420,0001,096,0002,113,536
5Jun 30, 2026 10:4660,92732,045,65221,385,0001,158,0002,113,536
6Jun 30, 2026 10:4660,97232,486,17121,339,0001,221,0002,113,536
7Jun 30, 2026 10:4661,10032,027,03221,501,0001,106,0002,113,536
8Jun 30, 2026 10:4661,19432,084,04521,569,0001,073,0002,113,536
9Jun 30, 2026 10:4661,29133,488,07821,480,0001,198,0002,113,536