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:32Aniruddha DebAniruddha DebScore: 67,786Success
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:3267,51646,995,24923,982,000999,0002,420,736
2Mar 17, 2025 23:3267,78647,983,87023,075,0002,006,0002,531,328
3Mar 17, 2025 23:3269,95752,048,64024,889,000995,0002,531,328