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 18, 2026 12:14Victor MerckléVictor MerckléScore: 1,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 12:151,655257,599,891240,455,0007,926,00016,797,696
2Jun 18, 2026 12:151,655257,473,808240,452,0007,842,00016,797,696
3Jun 18, 2026 12:151,657258,170,668240,649,0007,961,00016,797,696
4Jun 18, 2026 12:151,657257,649,676240,525,0008,040,00016,797,696
5Jun 18, 2026 12:151,658257,924,415240,851,0007,906,00016,797,696
6Jun 18, 2026 12:151,660258,247,060240,817,0008,245,00016,797,696
7Jun 18, 2026 12:151,661258,344,215241,270,0007,952,00016,797,696
8Jun 18, 2026 12:151,662258,583,353241,431,0007,962,00016,797,696
9Jun 18, 2026 12:151,662259,488,489241,316,0008,103,00016,797,696