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 25, 2026 09:17Victor MerckléVictor MerckléScore: 262,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 09:18261,616104,709,69295,763,0001,035,0002,117,632stderr
2Jun 25, 2026 09:18262,116104,667,49895,944,0001,039,0002,117,632stderr
3Jun 25, 2026 09:18262,318105,125,76296,024,0001,034,0002,117,632stderr
4Jun 25, 2026 09:18262,364105,237,04596,044,0001,031,0002,117,632stderr
5Jun 25, 2026 09:18262,621104,633,09596,129,0001,041,0002,117,632stderr
6Jun 25, 2026 09:18262,978105,259,50696,264,0001,038,0002,117,632stderr
7Jun 25, 2026 09:18262,989105,330,61096,266,0001,040,0002,117,632stderr
8Jun 25, 2026 09:18263,097105,389,86096,286,0001,060,0002,117,632stderr
9Jun 25, 2026 09:18263,521105,520,12796,386,0001,117,0002,117,632stderr