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 5, 2024 08:52Huy Duc LeHuy Duc LeScore: 4,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2024 08:524,105684,221,412615,697,375016,900,096
2Mar 5, 2024 08:524,106673,038,665615,895,164016,904,192
3Mar 5, 2024 08:524,106682,043,108615,930,959016,994,304
4Mar 5, 2024 08:524,114640,289,569593,092,00024,003,00017,080,320
5Mar 5, 2024 08:524,116644,254,139583,400,00033,965,00017,088,512
6Mar 5, 2024 08:524,116650,368,725591,447,00025,975,00016,965,632
7Mar 5, 2024 08:524,116647,122,363586,471,00030,972,00016,982,016
8Mar 5, 2024 08:524,117644,417,162591,550,00025,980,00017,027,072
9Mar 5, 2024 08:524,118640,330,446590,725,00026,987,00017,121,280
10Mar 5, 2024 08:524,118644,424,258592,763,00024,990,00016,965,632
11Mar 5, 2024 08:524,118643,354,713583,777,00033,987,00017,051,648
12Mar 5, 2024 08:524,119641,105,314588,836,00028,991,00016,998,400