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 14:43Aniruddha DebAniruddha DebScore: 68,489Success
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 14:4368,36850,630,43624,285,0001,011,0002,531,328
2Aug 16, 2025 14:4368,48949,551,74825,341,00002,531,328
3Aug 16, 2025 14:4368,93042,912,11224,484,0001,020,0002,510,848