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 14, 2022 19:40Franek KortaFranek KortaScore: 154,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2022 19:40154,218113,461,84957,060,72402,269,184
2Aug 14, 2022 19:40154,405112,727,45657,129,79402,265,088
3Aug 14, 2022 19:40155,056118,204,52157,370,81002,269,184