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 listMay 26, 2025 07:13E SequeiraE SequeiraScore: 73,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2025 07:1373,50551,771,62825,183,0002,014,0002,265,088
2May 26, 2025 07:1373,67049,016,62825,239,0002,019,0002,285,568
3May 26, 2025 07:1374,83557,005,79326,664,0001,025,0002,285,568