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:09Victor MerckléVictor MerckléScore: 1,724Success
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:101,721267,403,374250,654,0007,603,00016,797,696
2Jun 8, 2026 13:101,723267,590,766250,875,0007,631,00016,797,696
3Jun 8, 2026 13:101,723267,691,107250,842,0007,671,00016,797,696
4Jun 8, 2026 13:101,723267,716,720250,836,0007,661,00016,797,696
5Jun 8, 2026 13:101,724267,710,679250,923,0007,680,00016,797,696
6Jun 8, 2026 13:101,724267,880,719251,024,0007,718,00016,797,696
7Jun 8, 2026 13:101,729268,926,131251,709,0007,778,00016,797,696
8Jun 8, 2026 13:101,730268,649,413251,809,0007,781,00016,797,696
9Jun 8, 2026 13:101,730268,674,218251,771,0007,765,00016,797,696