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 15:18Yuriy LyfenkoYuriy LyfenkoScore: 4,203Success
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 15:184,148679,293,932622,266,980016,941,056
2Apr 1, 2023 15:184,157698,544,028623,497,162016,941,056
3Apr 1, 2023 15:184,157681,048,080623,590,478016,936,960
4Apr 1, 2023 15:184,167652,788,900601,157,00023,966,00016,969,728
5Apr 1, 2023 15:184,180655,732,874604,025,00022,962,00017,104,896
6Apr 1, 2023 15:184,195655,002,246603,240,00025,967,00016,961,536
7Apr 1, 2023 15:184,203658,759,855606,481,00023,979,00016,961,536
8Apr 1, 2023 15:184,205663,283,929602,766,00027,989,00017,145,856
9Apr 1, 2023 15:184,215659,154,951606,279,00025,969,00016,969,728
10Apr 1, 2023 15:184,229663,707,694612,321,00021,975,00016,969,728
11Apr 1, 2023 15:184,248658,338,290615,193,00021,971,00016,957,440
12Apr 1, 2023 15:184,249663,077,021614,444,00022,979,00016,953,344