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 18:20anboto1anboto1Score: 2,759Success
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 18:202,744421,740,150397,286,00014,428,00016,793,600
2Jul 29, 2026 18:202,747422,284,018397,707,00014,479,00016,793,600
3Jul 29, 2026 18:202,749422,679,847397,798,00014,632,00016,793,600
4Jul 29, 2026 18:202,751422,801,404398,385,00014,396,00016,793,600
5Jul 29, 2026 18:202,759423,879,527399,246,00014,622,00016,793,600
6Jul 29, 2026 18:202,767425,349,797400,569,00014,498,00016,797,696
7Jul 29, 2026 18:202,768425,322,534400,798,00014,509,00016,793,600
8Jul 29, 2026 18:202,775426,384,201401,819,00014,483,00016,793,600
9Jul 29, 2026 18:202,791437,045,614403,762,00014,903,00016,793,600