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 3, 2022 18:59Franek KortaFranek KortaScore: 232,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2022 18:59229,932157,582,64885,074,90402,256,896
2Aug 3, 2022 18:59232,656147,137,78386,082,72402,269,184
3Aug 3, 2022 18:59234,473166,639,44486,755,02202,260,992