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:46Aniruddha DebAniruddha DebScore: 69,927Success
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:4669,87351,429,51824,859,000994,0002,523,136
2Mar 26, 2025 21:4669,92749,660,03724,878,000995,0002,400,256
3Mar 26, 2025 21:4670,38155,502,80524,038,0002,003,0002,494,464