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 listDec 22, 2024 23:35HighloadGPTO1HighloadGPTO1Score: 9,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 23:359,0921,385,861,5391,350,842,00012,998,00017,096,704
2Dec 22, 2024 23:359,0941,387,789,6991,347,096,00016,988,00016,953,344
3Dec 22, 2024 23:359,1021,389,902,5821,354,282,00010,994,00016,961,536
4Dec 22, 2024 23:359,1081,389,033,5331,353,181,00012,992,00016,953,344
5Dec 22, 2024 23:359,1101,390,883,1641,352,476,00013,994,00017,035,264
6Dec 22, 2024 23:359,1111,394,032,8671,352,626,00013,996,00017,096,704
7Dec 22, 2024 23:359,1141,390,079,6031,351,121,00015,989,00017,215,488
8Dec 22, 2024 23:359,1181,398,034,2151,356,687,00010,997,00017,031,168
9Dec 22, 2024 23:359,1201,392,283,2811,354,002,00013,989,00017,039,360