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 02:34Andrew EpsteinAndrew EpsteinScore: 18,682Success
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 02:3518,6732,810,680,2882,750,242,00050,814,00016,805,888stderr
2Nov 4, 2026 02:3518,6782,811,365,4322,751,051,00050,710,00016,801,792stderr
3Nov 4, 2026 02:3518,6802,811,615,8412,750,977,00051,041,00016,805,888stderr
4Nov 4, 2026 02:3518,6822,811,806,9172,751,822,00050,541,00016,805,888stderr
5Nov 4, 2026 02:3518,6822,811,923,6512,751,933,00050,504,00016,805,888stderr
6Nov 4, 2026 02:3518,6842,812,175,8322,752,147,00050,522,00016,801,792stderr
7Nov 4, 2026 02:3518,7212,817,710,7432,757,025,00051,184,00016,801,792stderr
8Nov 4, 2026 02:3518,7252,818,167,6442,757,688,00051,077,00016,805,888stderr
9Nov 4, 2026 02:3518,7292,819,277,0862,758,321,00051,116,00016,801,792stderr