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:31Victor MerckléVictor MerckléScore: 1,659Success
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:321,657257,717,513240,993,0007,652,00016,797,696
2Jun 17, 2026 16:321,658258,376,882241,109,0007,726,00016,797,696
3Jun 17, 2026 16:321,658257,965,232241,094,0007,714,00016,797,696
4Jun 17, 2026 16:321,659258,224,195241,185,0007,804,00016,797,696
5Jun 17, 2026 16:321,659258,072,053241,210,0007,771,00016,797,696
6Jun 17, 2026 16:321,660258,105,296241,192,0007,811,00016,797,696
7Jun 17, 2026 16:321,663258,625,370241,742,0007,794,00016,797,696
8Jun 17, 2026 16:321,663258,621,759241,826,0007,772,00016,797,696
9Jun 17, 2026 16:321,664258,930,539241,875,0007,846,00016,797,696