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 19, 2026 12:51Victor MerckléVictor MerckléScore: 1,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 12:521,649256,597,968239,598,0007,829,00016,797,696
2Jun 19, 2026 12:521,650256,736,689239,675,0007,947,00016,797,696
3Jun 19, 2026 12:521,650256,670,826239,688,0007,906,00016,797,696
4Jun 19, 2026 12:521,650256,586,006239,672,0007,874,00016,797,696
5Jun 19, 2026 12:521,650256,651,296239,522,0008,008,00016,797,696
6Jun 19, 2026 12:521,651256,827,349239,712,0007,974,00016,797,696
7Jun 19, 2026 12:521,654257,331,850240,336,0007,913,00016,797,696
8Jun 19, 2026 12:521,655257,363,244240,351,0007,957,00016,797,696
9Jun 19, 2026 12:521,658257,807,760240,719,0007,992,00016,797,696