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 13:41Victor MerckléVictor MerckléScore: 63,002Success
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 13:4262,56230,556,90922,136,0001,012,0002,113,536
2Jun 24, 2026 13:4262,62730,913,86222,142,0001,030,0002,113,536
3Jun 24, 2026 13:4262,65630,619,81722,179,0001,004,0002,113,536
4Jun 24, 2026 13:4262,70030,660,88723,199,00002,113,536
5Jun 24, 2026 13:4263,00230,742,01422,279,0001,032,0002,113,536
6Jun 24, 2026 13:4263,04830,770,34222,325,0001,003,0002,113,536
7Jun 24, 2026 13:4263,06731,405,12922,290,0001,045,0002,113,536
8Jun 24, 2026 13:4263,36231,113,74122,410,0001,034,0002,113,536
9Jun 24, 2026 13:4263,70231,055,35322,496,0001,074,0002,113,536