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 8, 2026 13:34Victor MerckléVictor MerckléScore: 1,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 13:351,718267,012,730250,105,0007,656,00016,797,696
2Jun 8, 2026 13:351,719267,509,433250,163,0007,742,00016,797,696
3Jun 8, 2026 13:351,719267,060,765250,144,0007,722,00016,797,696
4Jun 8, 2026 13:351,719267,230,882250,285,0007,710,00016,797,696
5Jun 8, 2026 13:351,720267,235,024250,378,0007,714,00016,797,696
6Jun 8, 2026 13:351,720267,256,023250,912,0007,116,00016,797,696
7Jun 8, 2026 13:351,724268,212,474250,917,0007,805,00016,797,696
8Jun 8, 2026 13:351,724267,933,457250,804,0007,807,00016,797,696
9Jun 8, 2026 13:351,725268,165,967251,087,0007,806,00016,797,696