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:25Yuriy LyfenkoYuriy LyfenkoScore: 4,556Success
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:254,266700,352,234639,936,929016,949,248
2Mar 24, 2023 16:254,272705,841,315640,765,178016,949,248
3Mar 24, 2023 16:254,275722,605,532641,234,098016,957,440
4Mar 24, 2023 16:254,350681,435,912625,501,00026,978,00017,022,976
5Mar 24, 2023 16:254,366687,946,908628,920,00025,955,00017,137,664
6Mar 24, 2023 16:254,508704,554,878648,199,00027,965,00016,969,728
7Mar 24, 2023 16:254,556705,690,248658,440,00024,978,00016,969,728
8Mar 24, 2023 16:254,569711,040,098659,435,00025,977,00016,965,632
9Mar 24, 2023 16:254,598717,472,028667,641,00021,988,00017,092,608
10Mar 24, 2023 16:254,598715,227,411665,678,00023,988,00016,953,344
11Mar 24, 2023 16:254,602715,621,486669,382,00020,980,00016,969,728
12Mar 24, 2023 16:254,685729,713,773675,705,00026,988,00017,059,840