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:01Victor MerckléVictor MerckléScore: 63,532Success
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:0262,81333,971,84623,241,00002,117,632stderr
2Jun 10, 2026 15:0262,87033,975,40422,251,0001,011,0002,117,632stderr
3Jun 10, 2026 15:0263,27834,128,88222,405,0001,008,0002,117,632stderr
4Jun 10, 2026 15:0263,48134,122,74722,453,0001,035,0002,117,632stderr
5Jun 10, 2026 15:0263,53234,203,28122,482,0001,025,0002,117,632stderr
6Jun 10, 2026 15:0263,58134,558,23322,514,0001,011,0002,117,632stderr
7Jun 10, 2026 15:0263,63734,293,15922,532,0001,014,0002,117,632stderr
8Jun 10, 2026 15:0264,16234,484,06922,738,0001,002,0002,117,632stderr
9Jun 10, 2026 15:0264,49434,634,53322,861,0001,002,0002,117,632stderr