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 17, 2025 23:30Aniruddha DebAniruddha DebScore: 69,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2025 23:3069,00052,927,05025,530,00002,428,928
2Mar 17, 2025 23:3069,22253,127,24925,612,00002,531,328
3Mar 17, 2025 23:3069,43554,276,19525,691,00002,531,328