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 listApr 1, 2023 19:25Yuriy LyfenkoYuriy LyfenkoScore: 4,239Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2023 19:254,143684,460,318621,498,218016,936,960
2Apr 1, 2023 19:254,144703,476,051621,530,821016,945,152
3Apr 1, 2023 19:254,144688,111,528621,655,538016,945,152
4Apr 1, 2023 19:254,228660,745,784610,262,00023,971,00016,961,536
5Apr 1, 2023 19:254,233666,723,615607,058,00027,956,00016,998,400
6Apr 1, 2023 19:254,238666,782,349613,771,00021,991,00017,006,592
7Apr 1, 2023 19:254,239663,166,234609,903,00025,995,00017,162,240
8Apr 1, 2023 19:254,240656,994,043609,023,00026,956,00016,969,728
9Apr 1, 2023 19:254,248661,024,114613,243,00023,970,00016,953,344
10Apr 1, 2023 19:254,262669,135,032612,318,00026,969,00017,125,376
11Apr 1, 2023 19:254,281665,983,770620,222,00021,972,00017,084,416
12Apr 1, 2023 19:254,292669,699,325615,916,00027,950,00017,039,360