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 5, 2022 21:27Franek KortaFranek KortaScore: 77,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2022 21:2776,54652,478,73825,288,0003,034,0002,281,472
2Aug 5, 2022 21:2776,91150,895,61127,441,0001,016,0002,281,472
3Aug 5, 2022 21:2776,99250,979,03926,453,0002,034,0002,281,472
4Aug 5, 2022 21:2777,04351,747,68726,470,0002,036,0002,523,136
5Aug 5, 2022 21:2777,36257,605,22627,602,0001,022,0002,281,472
6Aug 5, 2022 21:2777,43854,775,15728,652,00002,527,232
7Aug 5, 2022 21:2777,48652,024,35026,623,0002,047,0002,281,472
8Aug 5, 2022 21:2777,94654,717,92126,851,0001,989,0002,281,472
9Aug 5, 2022 21:2777,95153,915,90326,853,0001,989,0002,535,424
10Aug 5, 2022 21:2781,00195,199,41929,970,18602,265,088
11Aug 5, 2022 21:2781,79495,166,87630,263,74302,256,896
12Aug 5, 2022 21:2782,75296,255,98830,618,22102,256,896