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 28, 2023 20:04Franek KortaFranek KortaScore: 72,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 20:0472,52255,428,82025,840,000993,0002,510,848
2Aug 28, 2023 20:0472,58951,465,52423,874,0002,984,0002,428,928
3Aug 28, 2023 20:0472,61651,607,97125,873,000995,0002,424,832
4Aug 28, 2023 20:0472,62249,572,82324,880,0001,990,0002,523,136
5Aug 28, 2023 20:0472,67351,552,64324,898,0001,991,0002,514,944
6Aug 28, 2023 20:0472,67354,964,39225,894,000995,0002,514,944
7Aug 28, 2023 20:0472,80851,772,69724,944,0001,995,0002,514,944
8Aug 28, 2023 20:0473,14952,179,05825,061,0002,004,0002,514,944
9Aug 28, 2023 20:0473,21149,468,67026,085,0001,003,0002,519,040
10Aug 28, 2023 20:0477,88991,655,35528,819,03002,269,184
11Aug 28, 2023 20:0478,190111,100,65428,930,46902,269,184
12Aug 28, 2023 20:0478,301101,127,90028,971,55002,277,376