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:39Bernard TeoBernard TeoScore: 12,632Success
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:3911,8171,828,089,5611,772,481,942016,908,288
2Mar 25, 2023 22:3912,5411,934,300,5891,881,112,340016,908,288
3Mar 25, 2023 22:3912,5691,952,043,9341,885,327,632016,916,480
4Mar 25, 2023 22:3912,6321,962,764,6251,894,805,544016,912,384
5Mar 25, 2023 22:3912,6591,959,310,3751,898,839,754016,908,288
6Mar 25, 2023 22:3912,7681,981,329,2221,915,125,649016,912,384