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:53Huy Duc LeHuy Duc LeScore: 13,249Success
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:5313,2482,041,299,2691,987,260,005016,982,016
2Mar 6, 2024 06:5313,2492,047,500,9311,987,359,740016,977,920
3Mar 6, 2024 06:5313,2592,045,296,8391,988,785,131016,982,016