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:11Aniruddha DebAniruddha DebScore: 68,616Success
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:1167,85943,484,37523,100,0002,008,0002,424,832
2Aug 16, 2025 15:1168,61650,639,30125,388,00002,424,832
3Aug 16, 2025 15:1168,85144,952,47925,475,00002,506,752