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 listNov 4, 2026 01:24Andrew EpsteinAndrew EpsteinScore: 23,595Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 01:2623,5903,548,496,1963,483,909,00054,669,00016,801,792stderr
2Nov 4, 2026 01:2623,5913,548,176,7953,484,084,00054,649,00016,801,792stderr
3Nov 4, 2026 01:2623,5933,548,589,3483,484,209,00054,813,00016,801,792stderr
4Nov 4, 2026 01:2623,5943,548,773,9003,484,371,00054,821,00016,801,792stderr
5Nov 4, 2026 01:2623,5953,548,836,0453,484,536,00054,785,00016,801,792stderr
6Nov 4, 2026 01:2623,5973,549,392,3503,484,539,00055,159,00016,801,792stderr
7Nov 4, 2026 01:2623,6413,555,613,4473,490,976,00055,181,00016,801,792stderr
8Nov 4, 2026 01:2623,6423,555,785,9983,491,105,00055,264,00016,801,792stderr
9Nov 4, 2026 01:2623,6443,556,048,3773,491,341,00055,282,00016,801,792stderr