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:52Andrew EpsteinAndrew EpsteinScore: 18,902Success
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:5318,8862,842,512,1862,782,490,00050,457,00016,805,888stderr
2Nov 4, 2026 00:5318,8902,843,233,3542,783,148,00050,482,00016,805,888stderr
3Nov 4, 2026 00:5318,8992,844,355,3942,784,647,00050,315,00016,805,888stderr
4Nov 4, 2026 00:5318,9002,844,740,2972,784,642,00050,400,00016,805,888stderr
5Nov 4, 2026 00:5318,9022,844,894,7182,785,059,00050,387,00016,805,888stderr
6Nov 4, 2026 00:5318,9402,850,558,1152,790,292,00050,802,00016,805,888stderr
7Nov 4, 2026 00:5318,9432,850,895,1572,790,551,00050,916,00016,805,888stderr
8Nov 4, 2026 00:5318,9442,851,041,7642,790,633,00050,998,00016,805,888stderr
9Nov 4, 2026 00:5319,1752,886,855,6312,825,932,00050,423,00016,801,792stderr