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 listAug 3, 2024 08:02Kasper KivimäkiKasper KivimäkiScore: 5,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2024 07:575,188854,678,058778,188,806016,912,384
2Aug 3, 2024 07:575,195851,777,948779,236,844016,916,480
3Aug 3, 2024 07:575,197853,388,189779,527,589016,904,192
4Aug 3, 2024 08:035,497895,245,717824,572,688016,904,192
5Aug 3, 2024 08:035,499890,871,932824,885,434016,900,096
6Aug 3, 2024 08:035,502882,575,874825,319,659016,912,384
7Aug 3, 2024 08:025,617900,641,227842,593,318016,916,480
8Aug 3, 2024 08:025,618902,073,020842,756,630016,916,480
9Aug 3, 2024 08:025,620900,951,294843,006,872016,908,288