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 1, 2022 22:19Franek KortaFranek KortaScore: 129,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2022 22:19129,742105,268,90848,004,61102,256,896
2Aug 1, 2022 22:25129,760108,165,63048,011,25102,260,992
3Aug 1, 2022 22:25129,779108,719,46648,018,34502,269,184
4Aug 1, 2022 22:25129,876107,032,82548,054,04102,265,088
5Aug 1, 2022 22:19130,676120,555,24848,349,99002,301,952
6Aug 1, 2022 22:19130,700115,073,45348,358,88402,301,952