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 listMay 5, 2026 10:07Victor MerckléVictor MerckléScore: 1,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 10:081,865296,508,951269,755,00010,049,00017,149,952
2May 5, 2026 10:081,878298,279,032271,463,00010,317,00017,158,144
3May 5, 2026 10:081,887300,287,217272,498,00010,610,00017,145,856
4May 5, 2026 10:081,888300,026,689272,845,00010,465,00017,141,760
5May 5, 2026 10:081,895301,671,276274,095,00010,244,00017,158,144
6May 5, 2026 10:081,902303,716,258275,098,00010,221,00017,137,664
7May 5, 2026 10:081,904301,839,458275,982,0009,762,00017,137,664
8May 5, 2026 10:081,908306,455,071276,097,00010,179,00017,137,664
9May 5, 2026 10:081,984312,116,685287,596,00010,092,00017,141,760