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 13, 2025 23:39Aniruddha DebAniruddha DebScore: 170,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2025 23:39170,90084,145,69662,230,0001,003,0002,531,328
2Mar 13, 2025 23:39170,91686,587,67263,239,00002,437,120
3Mar 13, 2025 23:39171,13083,801,55061,308,0002,010,0002,531,328