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 26, 2025 21:20Aniruddha DebAniruddha DebScore: 69,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2025 21:2069,17654,612,21025,595,00002,523,136
2Mar 26, 2025 21:2069,35453,083,62125,661,00002,523,136
3Mar 26, 2025 21:2069,70350,951,69024,799,000991,0002,404,352