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 21:22Victor MerckléVictor MerckléScore: 75,578Success
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 21:2275,24536,886,97126,578,0001,263,0002,113,536
2Jun 24, 2026 21:2275,31836,967,37726,597,0001,271,0002,113,536
3Jun 24, 2026 21:2275,55637,055,70426,677,0001,279,0002,113,536
4Jun 24, 2026 21:2275,56437,052,15826,691,0001,268,0002,113,536
5Jun 24, 2026 21:2275,57837,121,39926,689,0001,275,0002,113,536
6Jun 24, 2026 21:2275,92137,183,74326,803,0001,288,0002,113,536
7Jun 24, 2026 21:2275,95137,268,02126,826,0001,276,0002,113,536
8Jun 24, 2026 21:2276,08137,232,27127,126,0001,024,0002,113,536
9Jun 24, 2026 21:2276,15437,288,70227,145,0001,032,0002,113,536