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 listJul 9, 2026 17:04Victor MerckléVictor MerckléScore: 1,650Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 17:051,648256,898,840239,370,0007,967,00016,801,792stderr
2Jul 9, 2026 17:051,649257,097,289239,432,0008,043,00016,801,792stderr
3Jul 9, 2026 17:051,649256,978,161239,376,0008,048,00016,801,792stderr
4Jul 9, 2026 17:051,649256,950,065239,352,0008,016,00016,801,792stderr
5Jul 9, 2026 17:051,650257,131,456239,536,0008,023,00016,801,792stderr
6Jul 9, 2026 17:051,650257,155,752239,555,0008,016,00016,801,792stderr
7Jul 9, 2026 17:051,654257,743,090240,117,0008,033,00016,801,792stderr
8Jul 9, 2026 17:051,655257,923,987240,191,0008,061,00016,801,792stderr
9Jul 9, 2026 17:051,656258,089,880240,327,0008,186,00016,801,792stderr