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 22:31Aniruddha DebAniruddha DebScore: 69,400Success
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 22:3169,31151,507,85424,620,0001,025,0002,531,328
2Mar 17, 2025 22:3169,40051,894,54125,678,00002,531,328
3Mar 17, 2025 22:3169,95152,536,11124,887,000995,0002,424,832