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 24, 2023 16:08Yuriy LyfenkoYuriy LyfenkoScore: 4,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2023 16:084,267711,587,266639,993,713016,949,248
2Mar 24, 2023 16:084,271702,051,488640,609,234016,961,536
3Mar 24, 2023 16:084,277701,973,777641,486,021016,953,344
4Mar 24, 2023 16:084,349679,063,691628,369,00023,975,00017,108,992
5Mar 24, 2023 16:084,364687,385,320625,705,00028,940,00017,068,032
6Mar 24, 2023 16:084,425691,860,053638,727,00024,989,00016,957,440
7Mar 24, 2023 16:084,494701,357,233648,156,00025,966,00016,982,016
8Mar 24, 2023 16:084,500703,147,212653,076,00021,968,00016,965,632
9Mar 24, 2023 16:084,549705,547,514657,347,00024,975,00017,063,936
10Mar 24, 2023 16:084,570708,799,428659,459,00025,978,00016,965,632
11Mar 24, 2023 16:084,577710,278,143656,572,00029,980,00017,186,816
12Mar 24, 2023 16:084,590715,437,282660,582,00027,982,00016,969,728