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:30Andrew EpsteinAndrew EpsteinScore: 1,573Success
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:301,572245,563,545229,141,0006,726,00016,793,600
2Nov 4, 2026 02:301,572245,145,587229,175,0006,650,00016,793,600
3Nov 4, 2026 02:301,572246,303,636229,232,0006,701,00016,793,600
4Nov 4, 2026 02:301,572245,184,013230,148,0005,762,00016,793,600
5Nov 4, 2026 02:301,573245,388,513229,290,0006,760,00016,793,600
6Nov 4, 2026 02:301,573245,759,137229,339,0006,748,00016,793,600
7Nov 4, 2026 02:301,576245,650,404229,765,0006,657,00016,793,600
8Nov 4, 2026 02:301,576245,937,639229,747,0006,677,00016,793,600
9Nov 4, 2026 02:301,576246,420,238229,670,0006,817,00016,793,600