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 24, 2023 18:49Bernard TeoBernard TeoScore: 12,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2023 19:0311,9711,858,134,6291,795,684,049016,928,768
2Mar 24, 2023 18:4911,9801,859,690,0951,796,927,334016,924,672
3Mar 24, 2023 19:0311,9901,853,196,8431,798,483,528016,924,672
4Mar 24, 2023 19:0312,0211,855,883,5911,803,159,799016,912,384
5Mar 24, 2023 18:4912,0391,858,854,7271,805,893,786016,928,768
6Mar 24, 2023 18:4912,1031,889,587,7261,815,436,393016,932,864