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 listSep 26, 2025 21:19Kirill020708Kirill020708Score: 111,963Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 21:19110,65716,644,241,15516,564,616,00033,956,00017,084,416
2Sep 26, 2025 21:19111,47416,764,176,54116,675,211,00045,939,00016,961,536
3Sep 26, 2025 21:19111,86016,830,180,60216,739,123,00039,947,00017,092,608
4Sep 26, 2025 21:19111,88016,825,074,95316,741,104,00040,948,00016,986,112
5Sep 26, 2025 21:19111,96316,845,216,96216,753,509,00040,945,00017,104,896
6Sep 26, 2025 21:19112,08916,857,774,85216,770,383,00042,949,00016,961,536
7Sep 26, 2025 21:19112,28016,891,932,85216,785,091,00056,925,00016,961,536
8Sep 26, 2025 21:19112,44316,912,505,84116,818,439,00047,941,00016,965,632
9Sep 26, 2025 21:19124,22818,685,625,11018,592,234,00041,953,00017,104,896