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:32Andrew EpsteinAndrew EpsteinScore: 23,631Success
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:3423,6183,553,003,3493,488,095,00054,713,00016,801,792stderr
2Nov 4, 2026 00:3423,6213,553,401,7933,488,350,00054,916,00016,801,792stderr
3Nov 4, 2026 00:3423,6223,553,046,4963,488,546,00054,859,00016,801,792stderr
4Nov 4, 2026 00:3423,6273,554,018,9643,489,303,00054,788,00016,801,792stderr
5Nov 4, 2026 00:3423,6313,554,127,7663,489,996,00054,694,00016,801,792stderr
6Nov 4, 2026 00:3423,6363,554,880,7773,490,864,00054,633,00016,801,792stderr
7Nov 4, 2026 00:3423,6773,561,152,3293,496,567,00055,080,00016,801,792stderr
8Nov 4, 2026 00:3423,6793,561,558,2163,496,631,00055,281,00016,801,792stderr
9Nov 4, 2026 00:3423,6803,561,445,1193,496,920,00055,144,00016,801,792stderr