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 13:11Huy Duc LeHuy Duc LeScore: 2,996Success
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 13:112,987471,586,046422,069,00026,004,00017,010,688
2Oct 31, 2025 13:112,988478,880,650415,303,00032,944,00017,113,088
3Oct 31, 2025 13:112,989478,631,089418,377,00029,955,00017,031,168
4Oct 31, 2025 13:112,994475,925,666420,163,00029,011,00017,072,128
5Oct 31, 2025 13:112,996476,786,718417,465,00031,959,00017,186,816
6Oct 31, 2025 13:113,002475,419,567418,226,00032,017,00017,010,688
7Oct 31, 2025 13:113,004478,117,546417,588,00032,967,00016,982,016
8Oct 31, 2025 13:113,009480,562,551414,394,00036,945,00017,051,648
9Oct 31, 2025 13:113,011475,121,364421,687,00029,977,00017,154,048