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 00:40Huy Duc LeHuy Duc LeScore: 3,047Success
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 00:402,990517,831,757448,522,576016,969,728
2Mar 7, 2024 00:402,993506,411,407448,903,968016,973,824
3Mar 7, 2024 00:402,997523,494,063449,579,043016,969,728
4Mar 7, 2024 00:403,038480,114,688422,761,00032,981,00017,018,880
5Mar 7, 2024 00:403,042485,662,944419,242,00037,021,00017,059,840
6Mar 7, 2024 00:403,047480,095,253430,041,00027,002,00017,018,880
7Mar 7, 2024 00:403,047487,589,156423,068,00034,005,00017,166,336
8Mar 7, 2024 00:403,048487,353,281421,199,00036,017,00017,010,688
9Mar 7, 2024 00:403,049485,297,546429,364,00027,958,00017,055,744
10Mar 7, 2024 00:403,050485,216,218420,534,00036,959,00017,010,688
11Mar 7, 2024 00:403,054481,299,961431,040,00027,002,00017,162,240
12Mar 7, 2024 00:403,063487,859,039417,483,00041,948,00017,018,880