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:59Aniruddha DebAniruddha DebScore: 68,641Success
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:5968,36843,795,63724,285,0001,011,0002,531,328
2Aug 16, 2025 14:5968,64150,827,84825,397,00002,420,736
3Aug 16, 2025 14:5968,84946,402,98725,474,00002,531,328