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:09Aniruddha DebAniruddha DebScore: 68,451Success
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:0968,19548,757,91524,223,0001,009,0002,531,328
2Aug 16, 2025 15:0968,45145,822,16925,327,00002,510,848
3Aug 16, 2025 15:0969,22250,563,06025,612,00002,531,328