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 17:06Victor MerckléVictor MerckléScore: 1,664Success
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 17:071,662258,543,462241,766,0007,679,00016,797,696
2Jun 17, 2026 17:071,663258,810,606241,795,0007,776,00016,797,696
3Jun 17, 2026 17:071,663258,671,735241,916,0007,679,00016,797,696
4Jun 17, 2026 17:071,664258,883,489242,070,0007,672,00016,797,696
5Jun 17, 2026 17:071,664258,653,854241,929,0007,681,00016,797,696
6Jun 17, 2026 17:071,665258,952,979241,963,0007,910,00016,797,696
7Jun 17, 2026 17:071,668259,434,872242,571,0007,776,00016,797,696
8Jun 17, 2026 17:071,669259,664,611242,754,0007,734,00016,797,696
9Jun 17, 2026 17:071,671259,764,218242,847,0007,818,00016,797,696