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 listMar 5, 2024 08:34Huy Duc LeHuy Duc LeScore: 4,148Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2024 08:344,133689,274,977619,925,722016,916,480
2Mar 5, 2024 08:344,135644,776,973590,275,00030,013,00017,055,744
3Mar 5, 2024 08:344,144646,765,034588,567,00032,975,00017,043,456
4Mar 5, 2024 08:344,146702,396,031621,855,031016,904,192
5Mar 5, 2024 08:344,147644,301,501593,094,00029,004,00016,953,344
6Mar 5, 2024 08:344,147647,251,545590,114,00032,006,00017,096,704
7Mar 5, 2024 08:344,148689,607,341622,235,320016,908,288
8Mar 5, 2024 08:344,152648,624,019591,758,00030,987,00017,113,088
9Mar 5, 2024 08:344,153649,916,512588,937,00033,996,00017,031,168
10Mar 5, 2024 08:344,154648,472,550596,029,00027,001,00017,088,512
11Mar 5, 2024 08:344,177657,099,163592,505,00033,971,00016,965,632
12Mar 5, 2024 08:344,179649,292,747597,916,00028,995,00016,965,632