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 19:33Bernard TeoBernard TeoScore: 11,718Success
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:3211,5781,804,697,1561,736,639,274016,932,864
2Mar 24, 2023 19:3211,6031,802,928,7911,740,434,953016,928,768
3Mar 24, 2023 19:3311,6861,822,362,8491,752,832,900016,932,864
4Mar 24, 2023 19:3311,7181,824,376,8621,757,679,319016,936,960
5Mar 24, 2023 19:3311,7521,838,843,8251,762,814,744016,936,960
6Mar 24, 2023 19:3211,7701,836,683,3791,765,553,029016,928,768