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 16:47Victor MerckléVictor MerckléScore: 63,491Success
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 16:4863,05630,959,42323,331,00002,113,536
2Jun 24, 2026 16:4863,25430,844,26323,404,00002,113,536
3Jun 24, 2026 16:4863,32131,081,17023,429,00002,113,536
4Jun 24, 2026 16:4863,40230,936,99222,433,0001,026,0002,113,536
5Jun 24, 2026 16:4863,49130,892,55823,492,00002,113,536
6Jun 24, 2026 16:4863,64531,018,36623,549,00002,113,536
7Jun 24, 2026 16:4863,86431,443,47123,630,00002,113,536
8Jun 24, 2026 16:4864,28331,794,39323,785,00002,113,536
9Jun 24, 2026 16:48628,400239,918,659232,508,00002,113,536