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 listMay 6, 2025 11:26etherealetherealScore: 4,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2025 11:264,130645,330,256610,543,0008,993,00017,084,416
2May 6, 2025 11:264,131646,705,652610,592,0008,993,00017,100,800
3May 6, 2025 11:264,131648,627,321612,634,0006,995,00016,953,344
4May 6, 2025 11:264,133649,880,788609,936,0009,998,00017,035,264
5May 6, 2025 11:264,134644,963,253610,087,00010,001,00017,039,360
6May 6, 2025 11:264,135650,643,358611,304,0009,004,00017,035,264
7May 6, 2025 11:264,138652,873,684612,733,0007,996,00017,031,168
8May 6, 2025 11:264,139649,379,032610,881,0009,998,00017,154,048
9May 6, 2025 11:264,152650,190,340613,824,0008,997,00017,043,456