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:33Huy Duc LeHuy Duc LeScore: 3,012Success
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:332,956516,721,422443,410,196016,961,536
2Mar 7, 2024 02:332,958501,956,156443,757,073016,957,440
3Mar 7, 2024 02:332,961505,236,012444,194,638016,961,536
4Mar 7, 2024 02:333,005473,274,215417,701,00032,976,00017,096,704
5Mar 7, 2024 02:333,010480,923,090417,514,00033,960,00017,031,168
6Mar 7, 2024 02:333,012475,434,920420,796,00030,985,00017,100,800
7Mar 7, 2024 02:333,012473,158,247422,842,00028,989,00017,117,184
8Mar 7, 2024 02:333,014477,058,216420,118,00032,009,00016,949,248
9Mar 7, 2024 02:333,016476,199,638417,455,00034,954,00017,006,592
10Mar 7, 2024 02:333,020482,293,596419,948,00032,995,00017,195,008
11Mar 7, 2024 02:333,022480,381,710418,403,00034,950,00017,104,896
12Mar 7, 2024 02:333,023479,830,868420,425,00032,954,00016,986,112