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 21, 2026 16:19Andrew EpsteinAndrew EpsteinScore: 1,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 16:201,611250,492,762237,451,0004,270,00016,797,696
2Sep 21, 2026 16:201,613251,385,412237,790,0004,279,00016,797,696
3Sep 21, 2026 16:201,613251,497,360237,745,0004,258,00016,797,696
4Sep 21, 2026 16:201,613251,625,261237,852,0004,239,00016,797,696
5Sep 21, 2026 16:201,615251,315,861238,140,0004,173,00016,797,696
6Sep 21, 2026 16:201,616253,230,845238,225,0004,271,00016,797,696
7Sep 21, 2026 16:201,616251,446,043238,166,0004,305,00016,797,696
8Sep 21, 2026 16:201,617251,275,086238,473,0004,148,00016,797,696
9Sep 21, 2026 16:201,618251,726,086238,364,0004,351,00016,797,696