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 listNov 1, 2025 02:43Huy Duc LeHuy Duc LeScore: 2,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2025 02:432,981473,857,150419,084,00028,005,00017,063,936
2Nov 1, 2025 02:432,989477,293,273425,398,00022,967,00017,154,048
3Nov 1, 2025 02:432,990473,340,415418,521,00029,965,00016,990,208