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 30, 2026 03:39Elijah KinElijah KinScore: 9,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 03:398,8361,335,382,5881,300,659,00024,808,00016,793,600
2May 30, 2026 03:398,8751,340,868,2971,306,551,00024,809,00016,793,600
3May 30, 2026 03:398,9371,353,002,4401,316,393,00024,227,00016,793,600
4May 30, 2026 03:399,0931,375,216,0461,339,087,00024,936,00016,793,600
5May 30, 2026 03:399,0951,373,910,4511,339,129,00025,205,00016,793,600
6May 30, 2026 03:399,1191,381,604,6061,342,313,00025,576,00016,793,600
7May 30, 2026 03:399,1661,384,924,7071,349,477,00025,529,00016,793,600
8May 30, 2026 03:399,1831,389,186,7481,352,105,00025,434,00016,793,600
9May 30, 2026 03:399,4171,422,507,1091,387,483,00025,215,00016,793,600