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 6, 2022 14:28Eugene ZhydzetskiEugene ZhydzetskiScore: 111,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2022 14:28110,48170,493,66538,884,0001,994,0002,535,424
2Sep 6, 2022 14:28110,62472,530,41038,935,0001,996,0002,531,328
3Sep 6, 2022 14:28110,76867,989,89239,985,000999,0002,334,720
4Sep 6, 2022 14:28110,89573,495,62939,030,0002,001,0002,334,720
5Sep 6, 2022 14:28110,89567,098,84238,029,0003,002,0002,334,720
6Sep 6, 2022 14:28110,92470,333,06539,040,0002,002,0002,334,720
7Sep 6, 2022 14:28111,03866,625,49838,078,0003,006,0002,334,720
8Sep 6, 2022 14:28111,75468,149,24340,341,0001,008,0002,531,328
9Sep 6, 2022 14:28111,90062,663,62239,384,0002,019,0002,334,720
10Sep 6, 2022 14:28113,62297,208,11942,040,09502,207,744
11Sep 6, 2022 14:28113,887114,834,76242,138,04502,203,648
12Sep 6, 2022 14:28114,34792,035,56442,308,31202,195,456