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 19, 2023 18:54LiamLiamScore: 7,255Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2023 18:564,732765,728,520709,828,734016,969,728
2Mar 19, 2023 18:564,770793,864,579715,530,924016,961,536
3Mar 19, 2023 18:564,793778,752,698719,024,121016,953,344
4Mar 19, 2023 18:547,2551,160,629,3361,088,184,608016,957,440
5Mar 19, 2023 18:547,3081,154,041,9841,096,151,330016,957,440
6Mar 19, 2023 18:547,5181,197,552,5571,127,665,236016,957,440