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 listNov 20, 2023 21:06mmalczakmmalczakScore: 18,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2023 21:0118,5132,848,986,5042,776,905,847016,957,440
2Nov 20, 2023 21:0618,5172,832,873,8512,777,524,037016,953,344
3Nov 20, 2023 21:0118,5662,844,419,7472,784,855,373016,953,344
4Nov 20, 2023 21:0618,5692,843,914,4832,785,303,738016,953,344
5Nov 20, 2023 21:0118,6662,884,332,9142,799,890,357016,949,248
6Nov 20, 2023 21:0618,6762,868,595,5552,801,474,618016,949,248