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 15:05Victor MerckléVictor MerckléScore: 1,669Success
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 15:061,667259,480,408242,461,0007,654,00016,797,696
2Jun 17, 2026 15:061,668259,869,142242,478,0007,726,00016,797,696
3Jun 17, 2026 15:061,668259,596,382242,540,0007,735,00016,797,696
4Jun 17, 2026 15:061,668259,658,240242,603,0007,660,00016,797,696
5Jun 17, 2026 15:061,669259,761,966242,671,0007,821,00016,797,696
6Jun 17, 2026 15:061,669260,229,238242,638,0007,727,00016,797,696
7Jun 17, 2026 15:061,672260,267,587243,212,0007,734,00016,797,696
8Jun 17, 2026 15:061,674260,436,933243,337,0007,766,00016,797,696
9Jun 17, 2026 15:061,675260,750,904243,365,0007,910,00016,797,696