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 listAug 16, 2025 15:38Aniruddha DebAniruddha DebScore: 65,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 15:3865,53048,495,17423,236,0001,010,0002,433,024
2Aug 16, 2025 15:3865,54645,793,66823,242,0001,010,0002,531,328
3Aug 16, 2025 15:3865,90046,449,23724,383,00002,510,848