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 29, 2021 16:47piculpiculScore: 72,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2021 16:4770,52184,448,58326,092,82602,265,088
2Sep 29, 2021 16:4771,15390,331,51526,326,78202,248,704
3Sep 29, 2021 16:4771,16786,602,21326,331,63202,269,184
4Sep 29, 2021 16:4771,88652,740,17225,575,0001,023,0002,285,568
5Sep 29, 2021 16:4771,89557,166,88526,601,00002,285,568
6Sep 29, 2021 16:4772,06249,713,42325,638,0001,025,0002,285,568
7Sep 29, 2021 16:4772,21151,802,62725,691,0001,027,0002,527,232
8Sep 29, 2021 16:4772,50551,647,43024,840,0001,987,0002,285,568
9Sep 29, 2021 16:4772,58451,415,33125,862,000994,0002,527,232
10Sep 29, 2021 16:4772,60052,978,84726,862,00002,285,568
11Sep 29, 2021 16:4772,60051,365,10324,873,0001,989,0002,371,584
12Sep 29, 2021 16:4772,69748,993,35625,864,0001,034,0002,285,568