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 17:42M-RochatM-RochatScore: 4,190Success
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 17:424,182637,175,606606,259,00021,189,00016,793,600
2May 22, 2026 17:424,186639,036,595606,588,00021,359,00016,793,600
3May 22, 2026 17:424,188638,280,641607,038,00021,268,00016,793,600
4May 22, 2026 17:424,189638,187,943607,102,00021,269,00016,793,600
5May 22, 2026 17:424,190638,316,554607,310,00021,262,00016,793,600
6May 22, 2026 17:424,191640,218,368607,218,00021,492,00016,793,600
7May 22, 2026 17:424,206640,637,921610,275,00020,659,00016,793,600
8May 22, 2026 17:424,243648,006,156615,250,00021,227,00016,793,600
9May 22, 2026 17:424,244646,489,501615,809,00020,845,00016,793,600