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 listJan 8, 2026 20:249999199991Score: 3,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 20:243,719585,452,538504,897,00052,989,00017,043,456
2Jan 8, 2026 20:243,719581,102,006508,917,00048,992,00017,072,128
3Jan 8, 2026 20:243,723585,482,913506,491,00051,947,00017,022,976
4Jan 8, 2026 20:243,725586,071,483507,754,00050,975,00017,174,528
5Jan 8, 2026 20:243,726585,947,663509,926,00048,992,00017,072,128
6Jan 8, 2026 20:243,733585,163,134509,962,00049,996,00017,055,744
7Jan 8, 2026 20:243,734586,581,352503,067,00057,007,00016,986,112
8Jan 8, 2026 20:243,735590,934,382514,375,00045,944,00017,084,416
9Jan 8, 2026 20:243,753592,694,648506,912,00055,990,00017,203,200