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 listApr 18, 2023 15:35Bernard TeoBernard TeoScore: 3,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2023 15:353,124547,875,419468,671,880016,891,904
2Apr 18, 2023 15:353,125536,787,331468,779,184016,900,096
3Apr 18, 2023 15:353,126543,294,681468,938,264016,900,096
4Apr 18, 2023 15:353,127540,578,737469,117,116016,908,288
5Apr 18, 2023 15:353,129553,637,786469,299,966016,908,288
6Apr 18, 2023 15:353,129528,690,817469,381,707016,904,192