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 26, 2023 10:53Alexander MonakovAlexander MonakovScore: 4,017Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 10:533,998662,279,902599,655,455017,002,496
2Mar 26, 2023 10:534,011656,228,982601,578,445017,006,592
3Mar 26, 2023 10:534,014623,101,758586,086,00016,002,00017,186,816
4Mar 26, 2023 10:534,014628,275,927587,114,00015,002,00017,092,608
5Mar 26, 2023 10:534,015655,635,421602,301,308017,002,496
6Mar 26, 2023 10:534,016630,393,332587,357,00015,009,00017,096,704
7Mar 26, 2023 10:534,017624,878,260587,549,00014,988,00017,137,664
8Mar 26, 2023 10:534,017624,100,115586,567,00015,988,00016,982,016
9Mar 26, 2023 10:534,017636,510,998586,626,00015,989,00017,096,704
10Mar 26, 2023 10:534,018627,256,043584,647,00017,989,00017,100,800
11Mar 26, 2023 10:534,018622,777,998587,774,00014,994,00017,092,608
12Mar 26, 2023 10:534,020626,591,131589,959,00012,999,00017,096,704