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:20Huy Duc LeHuy Duc LeScore: 2,976Success
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:202,975471,398,004410,162,00036,014,00017,154,048
2Nov 1, 2025 02:202,976470,352,540415,448,00030,958,00017,002,496
3Nov 1, 2025 02:202,977473,583,311417,636,00028,974,00016,982,016