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 5, 2026 01:04Victor MerckléVictor MerckléScore: 1,855Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 01:051,851286,943,241269,275,0008,518,00016,797,696
2Jun 5, 2026 01:051,853287,206,113269,460,0008,619,00016,797,696
3Jun 5, 2026 01:051,855287,365,151269,696,0008,568,00016,797,696
4Jun 5, 2026 01:051,855287,389,045268,492,0009,765,00016,797,696
5Jun 5, 2026 01:051,855287,427,242269,830,0008,485,00016,797,696
6Jun 5, 2026 01:051,856287,489,982268,828,0009,588,00016,797,696
7Jun 5, 2026 01:051,860288,164,261269,444,0009,634,00016,797,696
8Jun 5, 2026 01:051,860288,241,014269,473,0009,622,00016,797,696
9Jun 5, 2026 01:051,860288,258,482270,501,0008,608,00016,797,696