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 29, 2026 14:33IlyaIlyaScore: 60,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 14:3660,76233,591,48421,349,0001,133,0002,113,536
2Jun 29, 2026 14:3660,81031,982,88421,358,0001,142,0002,113,536
3Jun 29, 2026 14:3660,92132,259,48021,357,0001,184,0002,113,536
4Jun 29, 2026 14:3660,93732,406,38121,364,0001,183,0002,113,536
5Jun 29, 2026 14:3660,99732,045,79221,477,0001,092,0002,113,536
6Jun 29, 2026 14:3661,11332,188,44121,374,0001,238,0002,113,536
7Jun 29, 2026 14:3661,12732,538,75321,409,0001,208,0002,113,536
8Jun 29, 2026 14:3661,17032,616,91421,441,0001,192,0002,113,536
9Jun 29, 2026 14:3661,37032,650,31321,466,0001,241,0002,113,536