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 19:36Victor MerckléVictor MerckléScore: 76,594Success
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 19:3776,34537,407,40526,980,0001,268,0002,113,536
2Jun 24, 2026 19:3776,35437,353,20726,989,0001,262,0002,113,536
3Jun 24, 2026 19:3776,43237,426,62227,014,0001,266,0002,113,536
4Jun 24, 2026 19:3776,57837,483,53227,054,0001,280,0002,113,536
5Jun 24, 2026 19:3776,59437,399,96627,069,0001,271,0002,113,536
6Jun 24, 2026 19:3776,87039,532,63227,161,0001,281,0002,113,536
7Jun 24, 2026 19:3776,97237,573,36827,459,0001,021,0002,113,536
8Jun 24, 2026 19:3776,98637,590,61127,204,0001,281,0002,113,536
9Jun 24, 2026 19:3777,00837,626,85027,470,0001,023,0002,113,536