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 listJun 8, 2026 13:21Victor MerckléVictor MerckléScore: 1,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 13:221,720267,221,275250,486,0007,640,00016,797,696
2Jun 8, 2026 13:221,721267,420,308250,615,0007,676,00016,797,696
3Jun 8, 2026 13:221,721267,364,068250,451,0007,761,00016,797,696
4Jun 8, 2026 13:221,721267,304,702250,471,0007,697,00016,797,696
5Jun 8, 2026 13:221,722267,476,359250,532,0007,801,00016,797,696
6Jun 8, 2026 13:221,722267,461,942250,560,0007,741,00016,797,696
7Jun 8, 2026 13:221,725267,980,741251,157,0007,719,00016,797,696
8Jun 8, 2026 13:221,726268,245,638251,302,0007,738,00016,797,696
9Jun 8, 2026 13:221,728268,531,561251,555,0007,769,00016,797,696