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:44Aniruddha DebAniruddha DebScore: 71,597Success
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:4471,35752,446,99226,402,00002,523,136
2Mar 26, 2025 21:4471,59749,434,55925,473,0001,018,0002,265,088
3Mar 26, 2025 21:4472,10551,865,79425,653,0001,026,0002,412,544