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 listMay 4, 2026 05:49Josu San MartinJosu San MartinScore: 58,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 05:5058,72137,356,83720,656,0001,071,0002,437,120
2May 4, 2026 05:5058,74338,674,23620,658,0001,077,0002,445,312
3May 4, 2026 05:5058,80838,435,72020,675,0001,084,0002,433,024
4May 4, 2026 05:5058,81638,591,97420,679,0001,083,0002,437,120
5May 4, 2026 05:5058,83236,622,25920,689,0001,079,0002,420,736
6May 4, 2026 05:5058,84539,023,43920,687,0001,086,0002,437,120
7May 4, 2026 05:5058,98137,481,62420,739,0001,084,0002,437,120
8May 4, 2026 05:5058,99737,486,19520,743,0001,086,0002,441,216
9May 4, 2026 05:5059,02137,191,02520,753,0001,085,0002,428,928