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 6, 2026 10:29Victor MerckléVictor MerckléScore: 64,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 10:3064,24332,848,59722,719,0001,051,0002,113,536
2Jun 6, 2026 10:3064,47232,923,21422,725,0001,130,0002,113,536
3Jun 6, 2026 10:3064,50832,957,02522,793,0001,075,0002,113,536
4Jun 6, 2026 10:3064,52932,941,34122,739,0001,137,0002,113,536
5Jun 6, 2026 10:3064,63233,024,43022,790,0001,124,0002,113,536
6Jun 6, 2026 10:3064,65132,976,98722,785,0001,136,0002,113,536
7Jun 6, 2026 10:3064,82133,054,05422,931,0001,053,0002,113,536
8Jun 6, 2026 10:3065,08633,146,43222,927,0001,155,0002,113,536
9Jun 6, 2026 10:3065,11033,217,50222,931,0001,160,0002,113,536