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 listMar 17, 2025 23:27Aniruddha DebAniruddha DebScore: 75,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2025 23:2774,91650,664,52626,693,0001,026,0002,420,736
2Mar 17, 2025 23:2775,38151,474,47327,891,00002,424,832
3Mar 17, 2025 23:2775,92251,523,67927,088,0001,003,0002,424,832