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:32Aniruddha DebAniruddha DebScore: 69,954Success
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:3269,93553,596,73924,881,000995,0002,531,328
2Mar 17, 2025 22:3269,95451,883,41823,892,0001,991,0002,531,328
3Mar 17, 2025 22:3270,78948,403,51825,185,0001,007,0002,424,832