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 listMar 27, 2026 23:22Dominique GarmierDominique GarmierScore: 3,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 23:223,498551,111,276501,652,00022,984,00017,145,856
2Mar 27, 2026 23:223,499549,563,894498,794,00025,989,00017,031,168
3Mar 27, 2026 23:223,499553,182,801498,914,00025,995,00016,953,344
4Mar 27, 2026 23:223,499549,673,872502,927,00021,996,00017,043,456
5Mar 27, 2026 23:223,500550,584,929499,068,00026,003,00017,039,360
6Mar 27, 2026 23:223,501551,260,780501,083,00024,003,00017,027,072
7Mar 27, 2026 23:223,501554,286,375498,090,00027,004,00017,088,512
8Mar 27, 2026 23:223,501555,039,235504,122,00021,005,00017,055,744
9Mar 27, 2026 23:223,501547,381,200500,145,00025,007,00017,141,760