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 10, 2026 15:06Victor MerckléVictor MerckléScore: 63,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 15:0763,02743,012,68523,320,00002,117,632stderr
2Jun 10, 2026 15:0763,04343,020,96422,291,0001,035,0002,117,632stderr
3Jun 10, 2026 15:0763,36243,189,44322,435,0001,009,0002,117,632stderr
4Jun 10, 2026 15:0763,45443,571,95522,471,0001,007,0002,117,632stderr
5Jun 10, 2026 15:0763,73243,618,74422,572,0001,009,0002,117,632stderr
6Jun 10, 2026 15:0763,78943,707,35522,580,0001,022,0002,117,632stderr
7Jun 10, 2026 15:0763,94043,364,91922,650,0001,008,0002,117,632stderr
8Jun 10, 2026 15:0763,97243,352,42722,666,0001,004,0002,117,632stderr
9Jun 10, 2026 15:07150,82775,563,58654,771,0001,035,0002,117,632stderr