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,359Success
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,343712,691,642651,406,007016,924,672
2May 22, 2024 18:264,344719,336,280651,612,840016,924,672
3May 22, 2024 18:264,352723,786,971652,874,671016,928,768
4May 22, 2024 18:264,355678,484,347607,299,00046,022,00017,092,608
5May 22, 2024 18:264,357674,541,806608,590,00044,969,00017,154,048
6May 22, 2024 18:264,357682,747,149605,645,00047,971,00017,178,624
7May 22, 2024 18:264,359678,343,545611,877,00041,991,00016,961,536
8May 22, 2024 18:264,360675,979,841610,060,00044,004,00016,961,536
9May 22, 2024 18:264,364684,140,972610,618,00043,972,00017,162,240
10May 22, 2024 18:264,364678,736,813609,694,00044,977,00016,961,536
11May 22, 2024 18:264,365681,163,705607,774,00046,982,00016,961,536
12May 22, 2024 18:264,366684,777,325608,939,00045,995,00017,154,048