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:12Huy Duc LeHuy Duc LeScore: 2,986Success
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:122,977472,812,114414,534,00031,964,00016,990,208
2Oct 31, 2025 14:122,977476,394,659416,638,00029,973,00016,990,208
3Oct 31, 2025 14:122,980469,884,397418,026,00029,001,00016,986,112
4Oct 31, 2025 14:122,984471,823,536415,684,00031,975,00016,982,016
5Oct 31, 2025 14:122,986470,009,658422,893,00024,993,00016,990,208
6Oct 31, 2025 14:122,986470,742,642412,935,00034,994,00016,990,208
7Oct 31, 2025 14:122,988474,293,879418,301,00029,950,00017,006,592
8Oct 31, 2025 14:122,996472,966,436417,392,00031,953,00016,994,304
9Oct 31, 2025 14:123,000472,177,228423,952,00025,997,00016,986,112