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 16, 2025 15:23Aniruddha DebAniruddha DebScore: 65,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 15:2365,35446,495,49022,166,0002,015,0002,428,928
2Aug 16, 2025 15:2365,48446,855,32523,220,0001,009,0002,519,040
3Aug 16, 2025 15:2365,61942,546,54023,268,0001,011,0002,428,928
4Aug 16, 2025 15:2365,71151,557,73424,313,00002,531,328
5Aug 16, 2025 15:2365,73546,444,92024,322,00002,531,328
6Aug 16, 2025 15:2365,74646,972,08124,326,00002,433,024
7Aug 16, 2025 15:2365,88150,501,24424,376,00002,531,328
8Aug 16, 2025 15:2365,88947,218,61423,364,0001,015,0002,531,328
9Aug 16, 2025 15:2366,06243,489,08923,425,0001,018,0002,428,928