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 17, 2023 16:55Bernard TeoBernard TeoScore: 3,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2023 16:553,585603,579,168537,790,744016,965,632
2Apr 17, 2023 16:553,586595,728,463537,967,623016,969,728
3Apr 17, 2023 16:553,587601,039,126538,021,813016,965,632
4Apr 17, 2023 16:553,587601,257,420538,100,726016,961,536
5Apr 17, 2023 16:553,592600,392,595538,874,872016,977,920
6Apr 17, 2023 16:553,592611,392,540538,788,389016,965,632