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 6, 2026 20:35Victor MerckléVictor MerckléScore: 1,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 20:351,755272,588,049255,698,0007,634,00016,797,696
2Jun 6, 2026 20:351,755272,606,350255,722,0007,657,00016,797,696
3Jun 6, 2026 20:351,755272,604,777255,683,0007,684,00016,797,696
4Jun 6, 2026 20:351,756272,774,208255,795,0007,730,00016,797,696
5Jun 6, 2026 20:351,757273,085,294255,818,0007,760,00016,797,696
6Jun 6, 2026 20:351,757272,767,806255,821,0007,757,00016,797,696
7Jun 6, 2026 20:351,761273,355,927256,518,0007,746,00016,797,696
8Jun 6, 2026 20:351,762273,613,500256,651,0007,691,00016,797,696
9Jun 6, 2026 20:351,763273,746,535256,717,0007,811,00016,797,696