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 9, 2026 13:30Karthik ReddyKarthik ReddyScore: 1,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 13:551,557242,783,987229,472,0004,213,00016,793,600
2Oct 9, 2026 13:551,558242,674,392229,574,0004,213,00016,793,600
3Oct 9, 2026 13:551,559243,036,075229,688,0004,224,00016,793,600
4Oct 9, 2026 13:551,559243,188,367229,740,0004,253,00016,793,600
5Oct 9, 2026 13:551,559242,940,615229,755,0004,238,00016,793,600
6Oct 9, 2026 13:551,561243,107,392229,875,0004,294,00016,793,600
7Oct 9, 2026 13:551,561243,248,740229,896,0004,299,00016,793,600
8Oct 9, 2026 13:551,573245,135,696231,662,0004,433,00016,793,600
9Oct 9, 2026 13:551,573245,048,345230,827,0005,244,00016,793,600