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 listAug 27, 2026 13:47Victor MerckléVictor MerckléScore: 1,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 13:481,609251,179,163233,571,0007,835,00016,801,792stderr
2Aug 27, 2026 13:481,610251,555,952233,641,0007,974,00016,801,792stderr
3Aug 27, 2026 13:481,610251,515,873233,707,0007,900,00016,801,792stderr
4Aug 27, 2026 13:481,610251,456,111233,663,0007,922,00016,801,792stderr
5Aug 27, 2026 13:481,610251,499,794233,576,0008,022,00016,801,792stderr
6Aug 27, 2026 13:481,611251,585,983233,765,0007,917,00016,805,888stderr
7Aug 27, 2026 13:481,612252,058,467233,916,0007,951,00016,801,792stderr
8Aug 27, 2026 13:481,614251,980,491234,144,0008,024,00016,801,792stderr
9Aug 27, 2026 13:481,617252,516,691234,409,0008,232,00016,801,792stderr