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 17:56LiamLiamScore: 34,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2023 02:0931,9934,873,815,2744,798,886,934016,953,344
2Feb 20, 2023 02:0931,9944,868,286,5784,799,030,030016,957,440
3Feb 20, 2023 02:0932,0074,870,675,6764,800,978,411016,949,248
4Mar 19, 2023 17:5634,2685,221,417,7915,140,154,471016,945,152
5Mar 19, 2023 17:5634,2725,217,219,1535,140,758,078016,953,344
6Mar 19, 2023 17:5634,2785,200,804,0835,141,726,102016,949,248