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 1, 2023 19:22Yuriy LyfenkoYuriy LyfenkoScore: 4,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2023 19:224,170682,115,707625,572,911016,945,152
2Apr 1, 2023 19:224,177717,926,507626,608,031016,936,960
3Apr 1, 2023 19:224,179691,936,314626,825,622016,924,672
4Apr 1, 2023 19:224,200652,795,707607,003,00022,962,00016,957,440
5Apr 1, 2023 19:224,210660,089,391606,566,00024,982,00016,969,728
6Apr 1, 2023 19:224,211658,599,415606,659,00024,985,00017,059,840
7Apr 1, 2023 19:224,211658,500,158606,668,00024,986,00017,018,880
8Apr 1, 2023 19:224,215659,394,204611,304,00020,976,00016,957,440
9Apr 1, 2023 19:224,220658,173,704606,088,00026,959,00016,969,728
10Apr 1, 2023 19:224,221659,908,835608,168,00024,965,00017,084,416
11Apr 1, 2023 19:224,227662,092,974609,059,00024,961,00016,953,344
12Apr 1, 2023 19:224,276664,741,428620,396,00020,979,00017,031,168