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 listSep 16, 2021 09:54Mikhail ShirokovMikhail ShirokovScore: 106,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2021 09:54105,53869,961,24538,048,0001,001,0002,519,040
2Sep 16, 2021 09:54105,58668,094,64638,066,0001,001,0002,396,160
3Sep 16, 2021 09:54105,66868,305,77238,095,0001,002,0002,519,040
4Sep 16, 2021 09:54105,81470,497,48637,144,0002,007,0002,519,040
5Sep 16, 2021 09:54106,02765,437,87638,225,0001,005,0002,519,040
6Sep 16, 2021 09:54106,20362,813,82339,295,00002,519,040
7Sep 16, 2021 09:54106,72459,967,13239,488,00002,519,040
8Sep 16, 2021 09:54107,07067,286,05638,601,0001,015,0002,469,888
9Sep 16, 2021 09:54107,12264,644,15139,635,00002,383,872
10Sep 16, 2021 09:54108,98299,823,48840,323,47402,203,648
11Sep 16, 2021 09:54109,700111,895,42140,588,83902,252,800
12Sep 16, 2021 09:54110,12499,488,32840,745,75102,256,896