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 20:29Victor MerckléVictor MerckléScore: 71,094Success
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 20:3070,91335,319,97525,217,0001,021,0002,113,536
2Jun 24, 2026 20:3070,92935,400,42725,223,0001,021,0002,113,536
3Jun 24, 2026 20:3071,02435,826,38325,255,0001,024,0002,113,536
4Jun 24, 2026 20:3071,04336,336,52625,265,0001,021,0002,113,536
5Jun 24, 2026 20:3071,09435,399,32025,019,0001,286,0002,113,536
6Jun 24, 2026 20:3071,10235,830,26925,018,0001,290,0002,113,536
7Jun 24, 2026 20:3071,30835,495,75525,100,0001,284,0002,113,536
8Jun 24, 2026 20:3071,34535,542,74625,377,0001,021,0002,113,536
9Jun 24, 2026 20:3071,35435,527,72525,380,0001,021,0002,113,536