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 19:12Victor MerckléVictor MerckléScore: 71,572Success
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 19:1371,13235,460,48325,234,0001,085,0002,146,304
2Jun 24, 2026 19:1371,22435,505,01725,268,0001,085,0002,146,304
3Jun 24, 2026 19:1371,33735,564,00925,299,0001,096,0002,146,304
4Jun 24, 2026 19:1371,52935,700,93325,335,0001,131,0002,146,304
5Jun 24, 2026 19:1371,57235,625,32525,346,0001,136,0002,146,304
6Jun 24, 2026 19:1371,62735,693,38925,366,0001,136,0002,146,304
7Jun 24, 2026 19:1371,88935,770,05924,460,0002,139,0002,146,304
8Jun 24, 2026 19:1371,91335,868,05824,509,0002,099,0002,146,304
9Jun 24, 2026 19:1372,00235,859,96724,549,0002,092,0002,146,304