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 12, 2026 10:23Victor MerckléVictor MerckléScore: 63,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 10:3063,35130,979,06623,440,00002,113,536
2Jun 12, 2026 10:3063,47031,069,32323,484,00002,113,536
3Jun 12, 2026 10:3063,66731,334,89123,557,00002,113,536
4Jun 12, 2026 10:3063,80831,141,59123,609,00002,113,536
5Jun 12, 2026 10:3063,88931,224,71523,639,00002,113,536
6Jun 12, 2026 10:3063,91031,214,65323,647,00002,113,536
7Jun 12, 2026 10:3064,09131,224,20423,714,00002,113,536
8Jun 12, 2026 10:3064,17031,293,15123,743,00002,113,536
9Jun 12, 2026 10:3064,19731,255,66623,753,00002,113,536