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 4, 2024 09:30Huy Duc LeHuy Duc LeScore: 373,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2024 09:30373,28056,047,409,69155,992,030,227016,949,248
2Mar 4, 2024 09:30373,29956,055,441,50855,994,889,350016,961,536
3Mar 4, 2024 09:30374,43556,243,939,89656,165,293,288016,953,344