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:32Aniruddha DebAniruddha DebScore: 70,786Success
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:3270,70350,792,63825,154,0001,006,0002,424,832
2Mar 17, 2025 23:3270,78648,814,85725,184,0001,007,0002,420,736
3Mar 17, 2025 23:3272,65953,742,81925,889,000995,0002,531,328