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:26Bernard 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:273,123535,249,640468,513,874016,908,288
2Apr 18, 2023 15:283,124538,943,907468,603,115016,904,192
3Apr 18, 2023 15:263,125544,370,329468,702,528016,896,000
4Apr 18, 2023 15:273,125538,091,435468,820,378016,908,288
5Apr 18, 2023 15:293,125533,842,086468,711,411016,896,000
6Apr 18, 2023 15:273,126528,698,573468,870,388016,908,288
7Apr 18, 2023 15:283,126532,261,125468,882,559016,912,384
8Apr 18, 2023 15:293,127535,460,592468,984,589016,900,096
9Apr 18, 2023 15:263,130540,409,316469,500,926016,900,096
10Apr 18, 2023 15:283,131536,853,457469,703,107016,896,000
11Apr 18, 2023 15:263,134545,822,940470,099,122016,887,808
12Apr 18, 2023 15:293,134552,394,113470,029,678016,912,384