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: 76,997Success
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:1175,87048,125,72727,070,0001,002,0002,531,328
2Aug 16, 2025 15:1176,99747,517,72927,472,0001,017,0002,424,832
3Aug 16, 2025 15:1177,13053,805,97427,519,0001,019,0002,420,736