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 00:47Andrew EpsteinAndrew EpsteinScore: 23,675Success
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 00:4823,6653,559,503,1663,495,111,00054,678,00016,801,792stderr
2Nov 4, 2026 00:4823,6693,559,865,9803,496,188,00054,290,00016,801,792stderr
3Nov 4, 2026 00:4823,6703,560,378,6533,495,533,00055,006,00016,801,792stderr
4Nov 4, 2026 00:4823,6743,560,701,1143,496,610,00054,624,00016,801,792stderr
5Nov 4, 2026 00:4823,6753,561,402,8823,496,633,00054,640,00016,801,792stderr
6Nov 4, 2026 00:4823,6773,561,044,6073,497,027,00054,639,00016,801,792stderr
7Nov 4, 2026 00:4823,7213,567,774,3343,503,117,00055,153,00016,801,792stderr
8Nov 4, 2026 00:4823,7223,567,862,8293,503,225,00055,195,00016,801,792stderr
9Nov 4, 2026 00:4823,7283,569,186,4393,504,193,00055,136,00016,801,792stderr