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:21Aniruddha DebAniruddha DebScore: 75,308Success
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:2174,89552,630,55526,685,0001,026,0002,437,120
2Mar 17, 2025 23:2175,30854,864,83525,874,0001,990,0002,433,024
3Mar 17, 2025 23:2175,48147,327,30425,934,0001,994,0002,510,848