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 17, 2026 16:01Victor MerckléVictor MerckléScore: 1,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 16:021,657258,143,730240,952,0007,602,00016,797,696
2Jun 17, 2026 16:021,659258,453,616241,288,0007,692,00016,797,696
3Jun 17, 2026 16:021,660258,655,559241,271,0007,786,00016,797,696
4Jun 17, 2026 16:021,660258,167,679241,330,0007,743,00016,797,696
5Jun 17, 2026 16:021,660258,157,287241,337,0007,742,00016,797,696
6Jun 17, 2026 16:021,661258,889,503241,496,0007,705,00016,797,696
7Jun 17, 2026 16:021,664259,359,065241,908,0007,781,00016,797,696
8Jun 17, 2026 16:021,666259,491,783242,055,0007,979,00016,797,696
9Jun 17, 2026 16:021,666259,012,780242,118,0007,792,00016,797,696