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 12:55Victor MerckléVictor MerckléScore: 62,954Success
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 12:5661,92930,291,86922,914,00002,113,536
2Jun 10, 2026 12:5662,15930,395,35922,999,00002,113,536
3Jun 10, 2026 12:5662,65130,570,57323,181,00002,113,536
4Jun 10, 2026 12:5662,82430,634,27823,245,00002,113,536
5Jun 10, 2026 12:5662,95430,746,76823,293,00002,113,536
6Jun 10, 2026 12:5663,06430,709,20823,334,00002,113,536
7Jun 10, 2026 12:5663,24031,026,98323,399,00002,113,536
8Jun 10, 2026 12:5663,35930,819,39923,443,00002,113,536
9Jun 10, 2026 12:56624,267238,367,231230,979,00002,113,536