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 18, 2026 16:29Victor MerckléVictor MerckléScore: 90,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 16:3088,01839,932,68625,197,0007,370,0002,113,536
2Jun 18, 2026 16:3088,90540,526,98824,880,0008,015,0002,113,536
3Jun 18, 2026 16:3090,29141,240,66825,862,0007,546,0002,113,536
4Jun 18, 2026 16:3090,65140,978,14426,175,0007,366,0002,113,536
5Jun 18, 2026 16:3090,74541,565,26126,507,0007,069,0002,113,536
6Jun 18, 2026 16:3090,76441,245,98226,182,0007,401,0002,113,536
7Jun 18, 2026 16:3090,85641,280,18026,205,0007,412,0002,113,536
8Jun 18, 2026 16:3090,90241,270,31325,696,0007,938,0002,113,536
9Jun 18, 2026 16:3092,41641,711,80626,138,0008,056,0002,113,536