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 21, 2026 11:09limanjun99limanjun99Score: 12,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 11:0912,5841,918,684,3231,842,741,00044,896,00017,117,184
2Mar 21, 2026 11:0912,6091,915,888,1681,845,469,00045,887,00017,190,912
3Mar 21, 2026 11:0913,4572,046,409,1811,976,696,00041,908,00017,055,744