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 listApr 18, 2023 15:18Bernard TeoBernard TeoScore: 3,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2023 15:183,123547,749,457468,444,555016,904,192
2Apr 18, 2023 15:183,126539,078,925468,894,906016,904,192
3Apr 18, 2023 15:183,126526,793,612468,879,769016,908,288
4Apr 18, 2023 15:183,126534,930,310468,945,548016,908,288
5Apr 18, 2023 15:183,127540,283,573468,994,262016,900,096
6Apr 18, 2023 15:183,130542,470,280469,465,729016,904,192