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 2, 2026 10:13A_ShamanA_ShamanScore: 4,009Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 10:134,006610,488,314575,501,00025,537,00016,793,600
2Jul 2, 2026 10:134,006610,392,147574,569,00026,391,00016,793,600
3Jul 2, 2026 10:134,007610,663,123574,705,00026,463,00016,793,600
4Jul 2, 2026 10:134,008610,613,480574,617,00026,602,00016,793,600
5Jul 2, 2026 10:134,009610,891,464574,948,00026,515,00016,793,600
6Jul 2, 2026 10:134,010610,907,282575,042,00026,484,00016,793,600
7Jul 2, 2026 10:134,010611,047,753575,548,00026,071,00016,793,600
8Jul 2, 2026 10:134,036614,974,360578,675,00026,866,00016,793,600
9Jul 2, 2026 10:134,039615,319,533578,978,00026,895,00016,793,600