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: 74,222Success
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,72251,889,69025,257,0002,020,0002,285,568
2May 26, 2025 07:1374,22257,576,30125,428,0002,034,0002,285,568
3May 26, 2025 07:1374,42251,378,86027,536,00002,285,568