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 14:26Huy Duc LeHuy Duc LeScore: 2,990Success
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 14:262,981471,161,292420,079,00027,005,00017,141,760
2Oct 31, 2025 14:262,983475,579,828420,506,00026,968,00017,092,608
3Oct 31, 2025 14:262,987476,623,865418,095,00030,006,00017,043,456
4Oct 31, 2025 14:262,990476,460,655423,462,00024,968,00017,162,240
5Oct 31, 2025 14:262,990475,411,023417,514,00030,963,00016,982,016
6Oct 31, 2025 14:262,990474,118,730411,547,00036,959,00017,088,512
7Oct 31, 2025 14:262,993471,732,043416,935,00031,995,00017,117,184
8Oct 31, 2025 14:262,995477,037,575421,296,00027,953,00017,096,704
9Oct 31, 2025 14:262,996475,309,108415,481,00033,957,00016,982,016