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 14:25Andrew EpsteinAndrew EpsteinScore: 1,754Success
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 14:261,751272,882,627256,048,0006,610,00016,793,600
2Sep 21, 2026 14:261,751273,032,297255,401,0007,304,00016,793,600
3Sep 21, 2026 14:261,751273,689,719256,110,0006,580,00016,793,600
4Sep 21, 2026 14:261,752273,108,111255,504,0007,356,00016,793,600
5Sep 21, 2026 14:261,754273,461,153255,837,0007,278,00016,793,600
6Sep 21, 2026 14:261,755273,500,572256,692,0006,622,00016,793,600
7Sep 21, 2026 14:261,755274,206,390256,656,0006,635,00016,793,600
8Sep 21, 2026 14:261,756274,532,876256,253,0007,232,00016,793,600
9Sep 21, 2026 14:261,756274,466,988256,164,0007,350,00016,793,600