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 18:27Victor MerckléVictor MerckléScore: 74,951Success
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 18:2874,92936,839,83026,613,0001,111,0002,113,536
2Jun 24, 2026 18:2874,93736,839,23426,605,0001,122,0002,113,536
3Jun 24, 2026 18:2874,94036,855,62726,622,0001,106,0002,113,536
4Jun 24, 2026 18:2874,94336,813,60126,702,0001,027,0002,113,536
5Jun 24, 2026 18:2874,95136,910,96026,621,0001,111,0002,113,536
6Jun 24, 2026 18:2874,98336,841,07226,650,0001,094,0002,113,536
7Jun 24, 2026 18:2875,06436,948,42126,748,0001,026,0002,113,536
8Jun 24, 2026 18:2875,07536,926,82626,662,0001,116,0002,113,536
9Jun 24, 2026 18:2875,35436,984,47926,853,0001,028,0002,113,536