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 26, 2025 21:38Aniruddha DebAniruddha DebScore: 69,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2025 21:3869,86853,416,72324,857,000994,0002,404,352
2Mar 26, 2025 21:3869,88944,139,13524,865,000994,0002,519,040
3Mar 26, 2025 21:3870,00046,461,78624,904,000996,0002,523,136