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:51Victor MerckléVictor MerckléScore: 57,070Success
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:5456,81829,190,66321,023,00002,113,536
2Aug 28, 2026 16:5456,89729,181,19220,026,0001,026,0002,113,536
3Aug 28, 2026 16:5456,91029,428,02720,038,0001,019,0002,113,536
4Aug 28, 2026 16:5457,03530,165,61920,074,0001,029,0002,113,536
5Aug 28, 2026 16:5457,07029,246,04320,111,0001,005,0002,113,536
6Aug 28, 2026 16:5457,12929,251,54020,136,0001,002,0002,113,536
7Aug 28, 2026 16:5457,13229,740,94420,104,0001,035,0002,113,536
8Aug 28, 2026 16:5457,21629,382,31720,150,0001,020,0002,113,536
9Aug 28, 2026 16:54144,44061,604,64652,442,0001,001,0002,113,536