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 20:23Dominique GarmierDominique GarmierScore: 38,601Success
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 20:2338,5955,822,571,7375,769,306,00019,987,00017,027,072
2Mar 27, 2026 20:2338,6015,821,157,4545,764,186,00025,987,00017,010,688
3Mar 27, 2026 20:2338,6185,819,681,9105,773,732,00018,992,00017,154,048