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 5, 2022 21:17Franek KortaFranek KortaScore: 139,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2022 21:17136,649145,388,92950,560,06802,293,760
2Aug 5, 2022 21:17139,508126,146,30651,617,94502,265,088
3Aug 5, 2022 21:17140,745115,371,68752,075,50602,285,568