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 31, 2025 15:41Huy Duc LeHuy Duc LeScore: 3,096Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2025 15:413,060483,048,143433,029,00026,001,00016,982,016
2Oct 31, 2025 15:413,096485,635,386425,509,00038,955,00016,986,112
3Oct 31, 2025 15:413,141501,893,705442,133,00029,008,00017,002,496