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:30Huy Duc LeHuy Duc LeScore: 3,174Success
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:303,166502,012,000450,894,00023,994,00017,002,496
2Nov 1, 2025 02:303,174499,136,684456,029,00020,001,00017,092,608
3Nov 1, 2025 02:303,176501,216,058448,421,00027,963,00017,166,336