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 2, 2026 06:53Victor MerckléVictor MerckléScore: 56,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 06:5456,82930,105,15220,004,0001,023,0002,113,536
2Aug 2, 2026 06:5456,93729,475,79920,062,0001,005,0002,113,536
3Aug 2, 2026 06:5456,97030,154,53320,071,0001,008,0002,113,536
4Aug 2, 2026 06:5456,97529,654,31620,060,0001,021,0002,113,536
5Aug 2, 2026 06:5456,97829,524,59120,057,0001,025,0002,113,536
6Aug 2, 2026 06:5457,04029,279,82421,105,00002,113,536
7Aug 2, 2026 06:5457,07829,664,60820,085,0001,034,0002,113,536
8Aug 2, 2026 06:5457,26729,390,35220,135,0001,054,0002,113,536
9Aug 2, 2026 06:54144,12961,632,31952,306,0001,022,0002,113,536