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 listMar 7, 2024 03:05Huy Duc LeHuy Duc LeScore: 3,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 03:052,943500,295,013441,508,331016,957,440
2Mar 7, 2024 03:052,946504,961,411441,880,921016,957,440
3Mar 7, 2024 03:052,949511,615,160442,338,173016,957,440
4Mar 7, 2024 03:052,995475,949,104424,266,00025,015,00017,166,336
5Mar 7, 2024 03:052,998473,148,382421,748,00027,983,00016,990,208
6Mar 7, 2024 03:052,999472,472,429416,798,00032,984,00017,018,880
7Mar 7, 2024 03:053,000473,679,407412,992,00036,999,00017,018,880
8Mar 7, 2024 03:053,000471,686,316418,012,00032,000,00017,080,320
9Mar 7, 2024 03:053,002478,549,296426,263,00024,014,00017,104,896
10Mar 7, 2024 03:053,002475,574,605423,288,00027,018,00017,018,880
11Mar 7, 2024 03:053,003474,068,480417,475,00033,037,00017,002,496
12Mar 7, 2024 03:053,005477,071,373421,738,00028,982,00017,018,880