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:21Yuriy LyfenkoYuriy LyfenkoScore: 4,521Success
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:214,316723,158,423647,451,037016,945,152
2Mar 21, 2023 04:214,324720,413,558648,548,492016,953,344
3Mar 21, 2023 04:214,327725,767,519648,990,141016,949,248
4Mar 21, 2023 04:214,364684,818,734629,708,00024,948,00016,965,632
5Mar 21, 2023 04:214,371679,079,545631,755,00023,952,00016,965,632
6Mar 21, 2023 04:214,487696,216,455644,027,00028,956,00016,953,344
7Mar 21, 2023 04:214,521700,647,040651,210,00026,967,00017,096,704
8Mar 21, 2023 04:214,534707,767,753656,163,00023,969,00016,957,440
9Mar 21, 2023 04:214,545705,572,589658,696,00022,989,00016,982,016
10Mar 21, 2023 04:214,566715,733,574660,971,00023,962,00017,072,128
11Mar 21, 2023 04:214,607717,161,515662,154,00028,963,00016,969,728
12Mar 21, 2023 04:214,610718,303,754665,559,00025,982,00016,965,632