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:20M-RochatM-RochatScore: 4,060Success
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:204,056619,284,254585,933,00022,473,00016,793,600
2May 22, 2026 23:204,057618,711,709586,047,00022,563,00016,793,600
3May 22, 2026 23:204,057619,599,516585,881,00022,741,00016,793,600
4May 22, 2026 23:204,059619,931,718586,561,00022,400,00016,793,600
5May 22, 2026 23:204,060620,174,248586,531,00022,554,00016,793,600
6May 22, 2026 23:204,061621,114,789586,998,00022,152,00016,793,600
7May 22, 2026 23:204,063618,665,725587,062,00022,419,00016,793,600
8May 22, 2026 23:204,066620,968,220587,025,00022,915,00016,793,600
9May 22, 2026 23:204,067619,944,380587,191,00022,986,00016,793,600