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 listSep 13, 2025 20:00Aleksei ShahoikaAleksei ShahoikaScore: 84,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2025 20:0084,20353,962,97730,150,0001,005,0002,285,568
2Sep 13, 2025 20:0084,20859,201,30529,147,0002,010,0002,260,992
3Sep 13, 2025 20:0084,36554,490,47630,209,0001,006,0002,285,568
4Sep 13, 2025 20:0084,44159,849,95730,236,0001,007,0002,285,568
5Sep 13, 2025 20:0084,54160,637,61930,271,0001,009,0002,285,568
6Sep 13, 2025 20:0084,65757,426,07029,303,0002,020,0002,285,568
7Sep 13, 2025 20:0084,90054,744,02430,400,0001,013,0002,285,568
8Sep 13, 2025 20:0085,30057,893,32830,543,0001,018,0002,285,568
9Sep 13, 2025 20:0085,38458,015,32430,573,0001,019,0002,519,040