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 23:22Aniruddha DebAniruddha DebScore: 75,832Success
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 23:2275,33048,849,43126,877,000995,0002,269,184
2Mar 17, 2025 23:2275,83251,305,51227,056,0001,002,0002,269,184
3Mar 17, 2025 23:2276,43546,907,70826,261,0002,020,0002,424,832