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 17, 2026 08:59M-RochatM-RochatScore: 7,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 08:597,0131,061,011,8071,044,667,0007,409,00016,793,600
2May 17, 2026 08:597,0231,064,279,1081,045,040,0008,525,00016,793,600
3May 17, 2026 08:597,0301,063,225,4091,047,117,0007,464,00016,793,600
4May 17, 2026 08:597,0321,065,955,7991,046,564,0008,368,00016,793,600
5May 17, 2026 08:597,0371,064,497,4791,048,231,0007,386,00016,793,600
6May 17, 2026 08:597,0381,064,843,7601,048,188,0007,558,00016,793,600
7May 17, 2026 08:597,0431,065,328,0331,048,074,0008,437,00016,793,600
8May 17, 2026 08:597,0491,068,921,2511,049,825,0007,574,00016,793,600
9May 17, 2026 08:597,1201,077,936,4471,060,336,0007,702,00016,793,600