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 19, 2023 03:28Yuriy LyfenkoYuriy LyfenkoScore: 3,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2023 03:283,976655,772,590596,348,874016,932,864
2Apr 19, 2023 03:283,976678,384,542596,376,126016,936,960
3Apr 19, 2023 03:283,976653,073,787596,448,706016,928,768
4Apr 19, 2023 03:283,992620,333,257572,842,00025,992,00017,207,296
5Apr 19, 2023 03:283,993621,812,082574,924,00023,996,00017,154,048
6Apr 19, 2023 03:283,995626,548,384574,241,00025,010,00016,969,728
7Apr 19, 2023 03:283,995629,935,630572,299,00027,014,00016,957,440
8Apr 19, 2023 03:283,996630,861,763572,330,00027,015,00016,998,400
9Apr 19, 2023 03:283,996634,716,132573,491,00025,976,00016,961,536
10Apr 19, 2023 03:284,000626,380,140571,986,00027,999,00017,203,200
11Apr 19, 2023 03:284,006627,690,734572,922,00027,996,00017,022,976
12Apr 19, 2023 03:284,013625,208,254573,881,00027,994,00016,957,440