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 listOct 31, 2025 15:41Huy Duc LeHuy Duc LeScore: 3,069Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2025 15:413,065482,559,897432,723,00026,982,00017,149,952
2Oct 31, 2025 15:413,069489,705,479432,443,00027,963,00017,174,528
3Oct 31, 2025 15:413,091487,324,274432,655,00030,975,00016,990,208