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:17Victor MerckléVictor MerckléScore: 75,064Success
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:1874,74836,832,80326,584,0001,073,0002,146,304
2Jun 24, 2026 19:1874,78936,867,18926,576,0001,096,0002,146,304
3Jun 24, 2026 19:1874,79436,901,00326,601,0001,073,0002,146,304
4Jun 24, 2026 19:1875,01337,051,53226,669,0001,086,0002,146,304
5Jun 24, 2026 19:1875,06437,051,20826,724,0001,050,0002,146,304
6Jun 24, 2026 19:1875,15637,058,73626,610,0001,198,0002,146,304
7Jun 24, 2026 19:1875,16737,104,24026,740,0001,072,0002,146,304
8Jun 24, 2026 19:1875,22437,657,77826,748,0001,085,0002,146,304
9Jun 24, 2026 19:1875,26437,097,70126,754,0001,094,0002,146,304