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 21:20Aniruddha DebAniruddha DebScore: 70,589Success
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 21:2070,42447,422,35824,053,0002,004,0002,531,328
2Mar 17, 2025 21:2070,58951,188,97925,114,0001,004,0002,531,328
3Mar 17, 2025 21:2070,75747,600,83225,174,0001,006,0002,531,328