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 25, 2023 22:03Bernard TeoBernard TeoScore: 12,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 22:0311,5401,788,028,1661,730,998,559017,010,688
2Mar 25, 2023 22:0512,3051,919,330,8831,845,678,280016,916,480
3Mar 25, 2023 22:0512,3541,922,687,1511,853,111,047016,932,864
4Mar 25, 2023 22:0512,4141,926,434,4481,862,080,471016,920,576
5Mar 25, 2023 22:0312,5161,928,732,9711,877,470,911016,924,672
6Mar 25, 2023 22:0312,5411,938,536,3331,881,100,520016,932,864