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 13, 2024 19:37Joad NacerJoad NacerScore: 4,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2024 19:374,484731,143,581672,671,479016,982,016
2May 13, 2024 19:374,489697,919,879629,357,00043,955,00017,149,952
3May 13, 2024 19:374,491697,539,973628,611,00044,972,00017,080,320
4May 13, 2024 19:374,491696,818,327627,693,00045,977,00017,149,952
5May 13, 2024 19:374,496697,833,872631,409,00042,959,00017,154,048
6May 13, 2024 19:374,498702,209,727628,691,00045,977,00017,088,512
7May 13, 2024 19:374,500699,242,725636,020,00039,001,00016,961,536
8May 13, 2024 19:374,501731,462,705675,156,573016,977,920
9May 13, 2024 19:374,503702,770,848625,453,00049,956,00017,108,992
10May 13, 2024 19:374,506739,557,546675,936,652016,855,040
11May 13, 2024 19:374,511700,432,359627,731,00048,979,00017,145,856
12May 13, 2024 19:374,512700,376,350625,875,00050,989,00017,133,568