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 listSep 26, 2026 18:23Kevin HeaveyKevin HeaveyScore: 1,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 18:261,556242,360,165228,915,0004,626,00016,793,600
2Sep 26, 2026 18:261,557242,500,579229,034,0004,628,00016,793,600
3Sep 26, 2026 18:261,558242,525,143229,016,0004,698,00016,793,600
4Sep 26, 2026 18:261,559242,656,357229,188,0004,696,00016,793,600
5Sep 26, 2026 18:261,559242,558,690228,688,0005,213,00016,793,600
6Sep 26, 2026 18:261,560242,706,946229,443,0004,680,00016,793,600
7Sep 26, 2026 18:261,561242,912,074228,745,0005,546,00016,793,600
8Sep 26, 2026 18:261,561242,961,111229,494,0004,682,00016,793,600
9Sep 26, 2026 18:261,567243,787,484230,434,0004,632,00016,793,600