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 24, 2026 11:23Victor MerckléVictor MerckléScore: 63,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 11:2563,07832,231,16122,294,0001,045,0002,113,536
2Jun 24, 2026 11:2563,19430,843,06222,338,0001,044,0002,113,536
3Jun 24, 2026 11:2563,47530,952,31322,459,0001,027,0002,113,536
4Jun 24, 2026 11:2563,50831,164,34022,488,0001,010,0002,113,536
5Jun 24, 2026 11:2563,54330,947,69122,494,0001,017,0002,113,536
6Jun 24, 2026 11:2563,59731,559,40322,491,0001,040,0002,113,536
7Jun 24, 2026 11:2563,67830,977,60822,560,0001,001,0002,113,536
8Jun 24, 2026 11:2564,36431,279,63222,794,0001,021,0002,113,536
9Jun 24, 2026 11:25152,86464,004,76555,529,0001,031,0002,113,536