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 17, 2026 23:15Victor MerckléVictor MerckléScore: 63,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 23:1662,47530,521,70123,116,00002,113,536
2Jun 17, 2026 23:1662,50230,762,24123,126,00002,113,536
3Jun 17, 2026 23:1662,89430,694,64223,271,00002,113,536
4Jun 17, 2026 23:1662,99431,996,67023,308,00002,113,536
5Jun 17, 2026 23:1663,20031,396,85423,384,00002,113,536
6Jun 17, 2026 23:1663,31631,395,49423,427,00002,113,536
7Jun 17, 2026 23:1663,72130,950,12723,577,00002,113,536
8Jun 17, 2026 23:1663,80831,002,69623,609,00002,113,536
9Jun 17, 2026 23:1663,87531,611,60023,634,00002,113,536