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:42Victor MerckléVictor MerckléScore: 56,181Success
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:4555,98329,840,09919,707,0001,007,0002,113,536
2Aug 28, 2026 16:4556,02429,031,40719,724,0001,005,0002,113,536
3Aug 28, 2026 16:4556,03529,821,35619,692,0001,041,0002,113,536
4Aug 28, 2026 16:4556,10529,806,05519,755,0001,004,0002,113,536
5Aug 28, 2026 16:4556,18128,906,93919,785,0001,002,0002,113,536
6Aug 28, 2026 16:4556,23229,901,01819,798,0001,008,0002,113,536
7Aug 28, 2026 16:4556,23729,214,18319,773,0001,035,0002,113,536
8Aug 28, 2026 16:4556,30829,905,71519,789,0001,045,0002,113,536
9Aug 28, 2026 16:4556,84031,131,24319,944,0001,087,0002,113,536