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 13, 2025 23:39Aniruddha DebAniruddha DebScore: 167,297Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2025 23:39167,14991,268,26761,845,00002,433,024
2Mar 13, 2025 23:39167,29781,141,20160,902,000998,0002,433,024
3Mar 13, 2025 23:39167,37386,255,21360,930,000998,0002,531,328