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 listJun 19, 2026 13:06Victor MerckléVictor MerckléScore: 1,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 13:071,648256,517,109239,391,0007,951,00016,797,696
2Jun 19, 2026 13:071,650256,822,306239,659,0007,983,00016,797,696
3Jun 19, 2026 13:071,650256,750,373239,679,0007,881,00016,797,696
4Jun 19, 2026 13:071,650256,706,997239,738,0007,897,00016,797,696
5Jun 19, 2026 13:071,651256,921,873239,745,0008,014,00016,797,696
6Jun 19, 2026 13:071,651256,824,800239,768,0007,898,00016,797,696
7Jun 19, 2026 13:071,655257,317,258240,345,0007,906,00016,797,696
8Jun 19, 2026 13:071,655257,552,469240,282,0008,109,00016,797,696
9Jun 19, 2026 13:071,656257,503,624240,368,0008,095,00016,797,696