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 listFeb 16, 2026 18:01Valentin KofmanValentin KofmanScore: 4,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 18:014,869755,887,546716,425,00013,969,00017,002,496
2Feb 16, 2026 18:014,876760,266,986717,359,00013,968,00016,998,400
3Feb 16, 2026 18:014,896754,519,362723,405,00010,975,00017,010,688