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:12E SequeiraE SequeiraScore: 74,046Success
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:1273,88659,876,66525,313,0002,025,0002,269,184
2May 26, 2025 07:1274,04659,732,01925,368,0002,029,0002,285,568
3May 26, 2025 07:1274,35952,500,68825,475,0002,038,0002,285,568