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 listSep 27, 2023 13:53apuxbtapuxbtScore: 11,509Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2023 13:5411,3221,766,388,6171,698,263,323016,961,536
2Sep 27, 2023 13:5411,3581,767,004,4181,703,751,738016,965,632
3Sep 27, 2023 13:5311,3991,767,804,5451,709,888,078016,957,440
4Sep 27, 2023 13:5211,4031,779,729,4491,710,473,476016,961,536
5Sep 27, 2023 13:5211,5091,807,433,0441,726,385,511016,957,440
6Sep 27, 2023 13:5211,5471,796,899,3981,732,040,352016,969,728
7Sep 27, 2023 13:5311,5541,792,895,3641,733,102,205016,965,632
8Sep 27, 2023 13:5412,2421,899,237,0241,836,247,605016,953,344
9Sep 27, 2023 13:5312,4611,946,218,3881,869,182,742016,945,152