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 listJul 12, 2023 21:31gchebanovgchebanovScore: 4,247Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 21:314,231697,680,409634,645,283016,916,480
2Jul 12, 2023 21:314,243667,097,546605,494,00030,974,00017,035,264
3Jul 12, 2023 21:314,245660,749,909609,803,00026,991,00017,068,032
4Jul 12, 2023 21:314,246664,360,933613,880,00022,995,00017,006,592
5Jul 12, 2023 21:314,246664,519,780610,917,00025,996,00017,018,880
6Jul 12, 2023 21:314,247694,601,903636,983,619016,912,384
7Jul 12, 2023 21:314,247660,628,382608,998,00027,999,00017,080,320
8Jul 12, 2023 21:314,247662,929,048612,113,00025,004,00017,133,568
9Jul 12, 2023 21:314,250668,412,763610,547,00026,980,00017,055,744
10Jul 12, 2023 21:314,250665,809,685611,561,00025,981,00017,063,936
11Jul 12, 2023 21:314,251662,682,780613,710,00023,988,00016,961,536
12Jul 12, 2023 21:314,259703,709,564638,790,238016,945,152