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 25, 2026 08:54Victor MerckléVictor MerckléScore: 57,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 08:5556,81028,678,79621,020,00002,113,536
2Jun 25, 2026 08:5556,89728,599,10720,027,0001,025,0002,113,536
3Jun 25, 2026 08:5556,98928,909,79920,049,0001,037,0002,113,536
4Jun 25, 2026 08:5556,98928,558,48920,078,0001,008,0002,113,536
5Jun 25, 2026 08:5557,02428,607,19221,099,00002,113,536
6Jun 25, 2026 08:5557,09728,590,84920,096,0001,030,0002,113,536
7Jun 25, 2026 08:5557,15428,972,53320,137,0001,010,0002,113,536
8Jun 25, 2026 08:5557,19128,855,22020,143,0001,018,0002,113,536
9Jun 25, 2026 08:55144,46260,920,91452,426,0001,025,0002,113,536