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:32Huy Duc LeHuy Duc LeScore: 4,107Success
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:324,088672,433,191613,250,045016,900,096
2Mar 5, 2024 08:324,089679,015,832613,384,054016,904,192
3Mar 5, 2024 08:324,089673,925,175613,413,229016,908,288
4Mar 5, 2024 08:324,090638,983,716584,540,00028,977,00017,035,264
5Mar 5, 2024 08:324,105639,414,326585,750,00029,987,00017,174,528
6Mar 5, 2024 08:324,106644,330,492587,900,00027,995,00017,055,744
7Mar 5, 2024 08:324,107641,977,888584,063,00032,003,00016,965,632
8Mar 5, 2024 08:324,111639,494,332587,609,00028,980,00017,125,376
9Mar 5, 2024 08:324,111643,704,022588,612,00027,981,00017,047,552
10Mar 5, 2024 08:324,111639,393,129588,723,00027,986,00017,043,456
11Mar 5, 2024 08:324,117639,885,795590,558,00026,979,00017,010,688
12Mar 5, 2024 08:324,118642,722,606582,710,00034,982,00017,129,472