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 27, 2023 22:07Franek KortaFranek KortaScore: 82,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2023 22:0781,716107,749,93830,235,04502,285,568
2Aug 27, 2023 22:0782,084105,762,85030,370,92702,293,760
3Aug 27, 2023 22:0782,835103,547,26930,649,09702,285,568