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:34Aniruddha DebAniruddha DebScore: 67,808Success
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:3467,58651,722,15424,007,0001,000,0002,531,328
2Mar 17, 2025 23:3467,80848,598,97023,082,0002,007,0002,510,848
3Mar 17, 2025 23:3468,13056,344,00023,192,0002,016,0002,531,328