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 02:58Huy Duc LeHuy Duc LeScore: 3,009Success
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 02:582,953496,836,869442,945,427016,965,632
2Mar 7, 2024 02:582,959512,175,412443,894,069016,961,536
3Mar 7, 2024 02:582,961504,268,431444,135,553016,965,632
4Mar 7, 2024 02:583,003478,564,657418,449,00031,957,00017,022,976
5Mar 7, 2024 02:583,006476,955,981424,968,00025,998,00016,994,304
6Mar 7, 2024 02:583,007473,855,571421,012,00030,000,00017,154,048
7Mar 7, 2024 02:583,009478,223,905419,290,00032,022,00017,059,840
8Mar 7, 2024 02:583,010479,668,532418,536,00032,963,00017,100,800
9Mar 7, 2024 02:583,013475,378,422423,990,00027,999,00017,027,072
10Mar 7, 2024 02:583,015475,638,776425,166,00027,010,00017,027,072
11Mar 7, 2024 02:583,017483,053,792422,519,00029,965,00017,051,648
12Mar 7, 2024 02:583,020475,552,388417,967,00034,997,00017,018,880