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 21, 2023 04:09Yuriy LyfenkoYuriy LyfenkoScore: 4,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2023 04:094,306715,504,496645,875,896016,953,344
2Mar 21, 2023 04:094,314703,696,401647,066,125016,949,248
3Mar 21, 2023 04:094,361716,210,546654,076,822016,953,344
4Mar 21, 2023 04:094,378681,149,213631,682,00024,947,00016,965,632
5Mar 21, 2023 04:094,384689,806,081633,561,00023,983,00016,994,304
6Mar 21, 2023 04:094,391686,001,897631,707,00026,944,00017,121,280
7Mar 21, 2023 04:094,416689,590,531638,415,00023,978,00016,953,344
8Mar 21, 2023 04:094,499700,802,348650,788,00023,992,00016,969,728
9Mar 21, 2023 04:094,617719,263,122669,510,00022,983,00017,072,128
10Mar 21, 2023 04:094,620722,634,854666,981,00025,960,00016,965,632
11Mar 21, 2023 04:094,620725,238,113669,014,00023,964,00017,002,496
12Mar 21, 2023 04:094,627718,153,908667,048,00026,961,00016,973,824