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 6, 2024 06:51Huy Duc LeHuy Duc LeScore: 93,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2024 06:5193,09714,040,480,00613,964,551,019017,178,624
2Mar 6, 2024 06:5193,11014,051,340,27213,966,451,241017,063,936
3Mar 6, 2024 06:5193,12514,028,230,49913,968,768,020017,068,032