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 23:29Yurkov AlekseyYurkov AlekseyScore: 4,485Success
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 23:294,476701,384,400656,346,00014,985,00017,170,432
2Mar 24, 2023 23:294,476695,883,552656,448,00014,987,00016,973,824
3Mar 24, 2023 23:294,478694,997,053658,728,00012,994,00016,961,536
4Mar 24, 2023 23:294,479703,789,635661,786,0009,996,00016,973,824
5Mar 24, 2023 23:294,479696,757,669656,872,00014,997,00017,145,856
6Mar 24, 2023 23:294,481738,295,097672,194,804016,941,056
7Mar 24, 2023 23:294,485749,544,453672,752,081016,936,960
8Mar 24, 2023 23:294,487701,644,438663,065,00010,000,00017,162,240
9Mar 24, 2023 23:294,489700,019,960661,372,00011,988,00017,149,952
10Mar 24, 2023 23:294,500736,716,148675,065,935016,932,864
11Mar 24, 2023 23:294,500697,276,543661,011,00014,000,00017,149,952
12Mar 24, 2023 23:294,503703,344,970656,498,00018,985,00017,051,648