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 listOct 21, 2026 00:18e1011e1011Score: 62,847Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 00:2062,5959,400,177,4789,384,698,0004,568,00016,793,600
2Oct 21, 2026 00:2062,6329,405,980,4719,390,564,0004,363,00016,793,600
3Oct 21, 2026 00:2062,6679,411,522,8259,394,643,0005,474,00016,793,600
4Oct 21, 2026 00:2062,7069,417,349,8929,400,320,0005,647,00016,793,600
5Oct 21, 2026 00:2062,8479,438,046,2199,422,708,0004,421,00016,793,600
6Oct 21, 2026 00:2062,9109,447,484,4819,432,219,0004,332,00016,793,600
7Oct 21, 2026 00:2062,9929,460,077,2429,443,321,0005,612,00016,793,600
8Oct 21, 2026 00:2063,0199,463,776,9399,448,521,0004,386,00016,793,600
9Oct 21, 2026 00:2063,8129,583,473,7889,567,455,0004,401,00016,793,600