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 14:28Kevin HeaveyKevin HeaveyScore: 1,585Success
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 14:291,582246,049,174230,928,0006,411,00016,793,600
2Sep 26, 2026 14:291,582246,579,032230,861,0006,458,00016,793,600
3Sep 26, 2026 14:291,582246,203,144230,934,0006,470,00016,793,600
4Sep 26, 2026 14:291,583246,235,627230,981,0006,473,00016,793,600
5Sep 26, 2026 14:291,585247,190,477231,352,0006,533,00016,793,600
6Sep 26, 2026 14:291,585247,802,927231,322,0006,533,00016,793,600
7Sep 26, 2026 14:291,585247,472,607231,168,0006,633,00016,793,600
8Sep 26, 2026 14:291,587247,502,780231,563,0006,541,00016,793,600
9Sep 26, 2026 14:291,593248,574,990232,585,0006,514,00016,793,600