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 22, 2024 18:26Joad NacerJoad NacerScore: 4,366Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 18:264,347713,328,900652,051,437016,916,480
2May 22, 2024 18:264,347708,865,470652,078,865016,916,480
3May 22, 2024 18:264,358681,646,916608,732,00044,980,00016,961,536
4May 22, 2024 18:264,360677,061,139608,057,00046,004,00017,174,528
5May 22, 2024 18:264,365678,392,474613,804,00040,986,00017,096,704
6May 22, 2024 18:264,366676,685,546612,894,00041,992,00017,129,472
7May 22, 2024 18:264,366677,592,716607,938,00046,995,00017,084,416
8May 22, 2024 18:264,370686,017,972611,484,00043,962,00017,113,088
9May 22, 2024 18:264,372679,818,824609,825,00045,986,00017,154,048
10May 22, 2024 18:264,373680,259,903604,905,00050,992,00017,031,168
11May 22, 2024 18:264,380684,491,809616,014,00041,000,00017,162,240
12May 22, 2024 18:264,471728,272,154670,629,225016,920,576