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 17:15Victor MerckléVictor MerckléScore: 63,075Success
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 17:1662,61834,241,57623,169,00002,113,536
2Jun 24, 2026 17:1662,72130,855,20123,207,00002,113,536
3Jun 24, 2026 17:1662,72930,828,24723,210,00002,113,536
4Jun 24, 2026 17:1662,93230,962,80723,285,00002,113,536
5Jun 24, 2026 17:1663,07530,755,27923,338,00002,113,536
6Jun 24, 2026 17:1663,25630,882,16723,405,00002,113,536
7Jun 24, 2026 17:1663,40831,122,86923,461,00002,113,536
8Jun 24, 2026 17:1663,61831,229,48023,539,00002,113,536
9Jun 24, 2026 17:1663,77831,360,00423,598,00002,113,536