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 20, 2026 17:09M-RochatM-RochatScore: 4,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 17:104,244646,350,705615,517,00021,201,00016,793,600
2May 20, 2026 17:104,249649,072,083616,188,00021,306,00016,793,600
3May 20, 2026 17:104,249648,876,752616,085,00021,410,00016,793,600
4May 20, 2026 17:104,255649,057,876617,054,00021,206,00016,793,600
5May 20, 2026 17:104,257649,867,480617,304,00021,341,00016,793,600
6May 20, 2026 17:104,261651,191,874618,069,00021,180,00016,793,600
7May 20, 2026 17:104,265650,891,362618,507,00021,357,00016,793,600
8May 20, 2026 17:104,266649,590,707619,018,00020,971,00016,793,600
9May 20, 2026 17:104,322660,571,446627,492,00020,883,00016,793,600