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 listJul 29, 2026 17:39anboto1anboto1Score: 2,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 17:402,884442,684,584424,080,0008,611,00016,793,600
2Jul 29, 2026 17:402,884442,714,821424,116,0008,614,00016,793,600
3Jul 29, 2026 17:402,887443,157,211424,556,0008,638,00016,793,600
4Jul 29, 2026 17:402,888443,219,216424,568,0008,735,00016,793,600
5Jul 29, 2026 17:402,889443,343,719424,631,0008,760,00016,793,600
6Jul 29, 2026 17:402,889443,545,813424,761,0008,716,00016,793,600
7Jul 29, 2026 17:402,889443,668,789424,737,0008,640,00016,793,600
8Jul 29, 2026 17:402,891443,708,238425,024,0008,702,00016,793,600
9Jul 29, 2026 17:402,894444,091,807425,514,0008,646,00016,793,600