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 29, 2026 19:33Dominique GarmierDominique GarmierScore: 363,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 19:33363,78054,619,224,15354,550,058,00016,991,00017,121,280
2Mar 29, 2026 19:33363,83054,635,693,73954,558,545,00015,990,00017,137,664
3Mar 29, 2026 19:33363,87454,632,426,42154,560,185,00020,989,00016,973,824