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 22, 2026 23:15M-RochatM-RochatScore: 4,067Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 23:164,059618,638,571586,049,00022,833,00016,793,600
2May 22, 2026 23:164,063621,899,968586,412,00023,053,00016,793,600
3May 22, 2026 23:164,064621,307,214586,634,00022,988,00016,793,600
4May 22, 2026 23:164,065620,600,588586,947,00022,912,00016,793,600
5May 22, 2026 23:164,067620,030,632587,070,00023,044,00016,793,600
6May 22, 2026 23:164,070621,600,760587,591,00023,021,00016,793,600
7May 22, 2026 23:164,070620,574,176587,107,00023,470,00016,793,600
8May 22, 2026 23:164,072621,111,648587,477,00023,463,00016,793,600
9May 22, 2026 23:164,073622,391,930587,789,00023,279,00016,793,600