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:19Huy Duc LeHuy Duc LeScore: 2,980Success
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:192,970470,664,878416,486,00028,964,00016,986,112
2Oct 31, 2025 15:192,971469,151,136418,641,00026,976,00016,973,824
3Oct 31, 2025 15:192,971472,359,789417,685,00027,978,00016,969,728
4Oct 31, 2025 15:192,980469,268,780410,952,00035,995,00016,973,824
5Oct 31, 2025 15:192,980468,507,049420,057,00027,003,00017,031,168
6Oct 31, 2025 15:192,981473,855,794415,207,00032,015,00017,145,856
7Oct 31, 2025 15:192,988475,938,551416,209,00032,016,00017,154,048
8Oct 31, 2025 15:192,989475,060,777422,406,00025,963,00017,170,432
9Oct 31, 2025 15:192,990478,751,320421,466,00026,965,00017,195,008