Large matrix multiplication Liam

Multiply two square matrices as fast as possible.

Input

Two 2000 x 2000 matrices of uint32 values on STDIN, encoded back-to-back in row-major order, little-endian byte order.

Output

Write the resulting 2000 x 2000 product matrix to STDOUT in the same binary format (row-major, little-endian uint32).

Back to listMar 24, 2023 18:03Alexander MonakovAlexander MonakovScore: 4,198Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2023 18:034,136679,708,781620,423,016017,006,592
2Mar 24, 2023 18:034,141694,038,280621,092,154016,998,400
3Mar 24, 2023 18:034,190650,862,674612,504,00015,987,00017,125,376
4Mar 24, 2023 18:034,191649,847,296605,624,00022,985,00017,092,608
5Mar 24, 2023 18:034,191653,864,422611,690,00016,991,00017,096,704
6Mar 24, 2023 18:034,196656,944,386608,466,00020,981,00017,162,240
7Mar 24, 2023 18:034,198653,413,702612,725,00016,992,00017,100,800
8Mar 24, 2023 18:034,205657,703,192617,824,00012,996,00017,100,800
9Mar 24, 2023 18:034,206652,160,955616,882,00013,997,00017,100,800
10Mar 24, 2023 18:034,209695,009,452631,397,973017,002,496
11Mar 24, 2023 18:034,231656,396,824614,620,00019,987,00017,043,456
12Mar 24, 2023 18:034,337669,008,057630,539,00019,985,00017,121,280