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 30, 2026 19:19Victor MerckléVictor MerckléScore: 1,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:201,603249,011,613232,839,0007,751,00016,801,792stderr
2Aug 30, 2026 19:201,604249,030,659232,841,0007,769,00016,801,792stderr
3Aug 30, 2026 19:201,604248,873,761232,961,0007,699,00016,801,792stderr
4Aug 30, 2026 19:201,605249,154,558233,087,0007,795,00016,801,792stderr
5Aug 30, 2026 19:201,605249,265,055233,047,0007,801,00016,801,792stderr
6Aug 30, 2026 19:201,606250,064,119233,246,0007,788,00016,801,792stderr
7Aug 30, 2026 19:201,607249,568,155233,386,0007,721,00016,801,792stderr
8Aug 30, 2026 19:201,610249,806,553233,810,0007,788,00016,801,792stderr
9Aug 30, 2026 19:201,612250,011,992233,939,0007,877,00016,801,792stderr