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 6, 2022 21:00Franek KortaFranek KortaScore: 74,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 21:0073,95149,554,57525,336,0002,026,0002,281,472
2Aug 6, 2022 21:0073,96256,445,78425,339,0002,027,0002,281,472
3Aug 6, 2022 21:0073,98153,884,51724,332,0003,041,0002,281,472
4Aug 6, 2022 21:0074,00052,362,30625,352,0002,028,0002,396,160
5Aug 6, 2022 21:0074,02450,692,48224,346,0003,043,0002,281,472
6Aug 6, 2022 21:0074,27850,129,85026,466,0001,017,0002,269,184
7Aug 6, 2022 21:0074,31450,032,87325,460,0002,036,0002,281,472
8Aug 6, 2022 21:0074,45451,729,95426,528,0001,020,0002,269,184
9Aug 6, 2022 21:0074,65456,325,70126,599,0001,023,0002,281,472
10Aug 6, 2022 21:0078,17498,400,87728,924,33202,265,088
11Aug 6, 2022 21:0078,42977,516,78229,018,59802,269,184
12Aug 6, 2022 21:0078,87496,862,06729,183,34402,301,952