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:13Bernard TeoBernard TeoScore: 12,534Success
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:1312,4911,930,529,7631,873,655,526016,920,576
2Mar 25, 2023 22:1312,5031,946,523,6021,875,511,811016,932,864
3Mar 25, 2023 22:1312,5051,941,683,3331,875,777,490016,928,768
4Mar 25, 2023 22:1312,5341,938,098,5431,880,104,568016,928,768
5Mar 25, 2023 22:1312,5411,945,441,2281,881,101,033016,928,768
6Mar 25, 2023 22:1312,5711,949,506,2371,885,662,926016,932,864