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 6, 2024 03:21Huy Duc LeHuy Duc LeScore: 3,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2024 03:213,216542,960,585482,333,282016,998,400
2Mar 6, 2024 03:213,217539,215,952482,556,905016,973,824
3Mar 6, 2024 03:213,220549,501,868483,031,225016,982,016
4Mar 6, 2024 03:213,226510,665,091440,966,00042,996,00016,998,400
5Mar 6, 2024 03:213,231505,696,041444,650,00039,968,00017,092,608
6Mar 6, 2024 03:213,238513,106,945432,751,00052,969,00016,994,304
7Mar 6, 2024 03:213,240521,564,490448,067,00038,005,00016,986,112
8Mar 6, 2024 03:213,243511,581,275440,502,00045,948,00017,195,008
9Mar 6, 2024 03:213,244510,879,765441,667,00044,966,00017,092,608
10Mar 6, 2024 03:213,249514,080,301446,454,00040,949,00017,133,568
11Mar 6, 2024 03:213,250515,303,139440,545,00046,951,00016,986,112
12Mar 6, 2024 03:213,251516,076,689434,630,00052,954,00016,994,304