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 listAug 28, 2026 16:35Victor MerckléVictor MerckléScore: 56,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 16:3656,45929,233,72319,851,0001,039,0002,113,536
2Aug 28, 2026 16:3656,47529,885,85019,859,0001,037,0002,113,536
3Aug 28, 2026 16:3656,47529,973,52119,887,0001,009,0002,113,536
4Aug 28, 2026 16:3656,54529,053,05720,922,00002,113,536
5Aug 28, 2026 16:3656,59730,023,65419,904,0001,037,0002,113,536
6Aug 28, 2026 16:3656,61830,049,52319,923,0001,026,0002,113,536
7Aug 28, 2026 16:3656,67530,078,65219,931,0001,039,0002,113,536
8Aug 28, 2026 16:3656,70829,209,96119,946,0001,036,0002,113,536
9Aug 28, 2026 16:36157,30567,268,62757,152,0001,051,0002,113,536