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:33Huy Duc LeHuy Duc LeScore: 4,121Success
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:334,108675,667,594616,241,733016,908,288
2Mar 5, 2024 08:334,109681,374,719616,309,811016,920,576
3Mar 5, 2024 08:334,112683,805,410616,746,520016,896,000
4Mar 5, 2024 08:334,118644,206,547587,726,00029,986,00016,953,344
5Mar 5, 2024 08:334,119640,837,063590,917,00026,996,00017,027,072
6Mar 5, 2024 08:334,120642,746,595590,042,00028,002,00016,965,632
7Mar 5, 2024 08:334,121640,614,567589,194,00029,009,00016,957,440
8Mar 5, 2024 08:334,123648,811,628589,508,00028,975,00017,051,648
9Mar 5, 2024 08:334,124639,910,214591,548,00026,979,00017,055,744
10Mar 5, 2024 08:334,124644,956,667593,566,00024,981,00017,051,648
11Mar 5, 2024 08:334,130645,963,544587,550,00031,975,00017,047,552
12Mar 5, 2024 08:334,132646,526,566586,847,00032,991,00017,043,456