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 14, 2025 22:27Aniruddha DebAniruddha DebScore: 71,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2025 22:2770,54349,750,56624,094,0002,007,0002,433,024
2Aug 14, 2025 22:2771,30350,166,65926,382,00002,269,184
3Aug 14, 2025 22:2772,02754,111,93025,625,0001,025,0002,428,928