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 12, 2026 05:56Victor MerckléVictor MerckléScore: 1,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 05:571,707265,195,851248,495,0007,632,00016,797,696
2Jun 12, 2026 05:571,708265,369,501248,557,0007,670,00016,797,696
3Jun 12, 2026 05:571,709265,438,777248,642,0007,713,00016,797,696
4Jun 12, 2026 05:571,709265,460,782248,681,0007,719,00016,797,696
5Jun 12, 2026 05:571,710265,651,390248,791,0007,760,00016,797,696
6Jun 12, 2026 05:571,710266,064,354248,610,0007,920,00016,797,696
7Jun 12, 2026 05:571,713266,193,292249,303,0007,790,00016,797,696
8Jun 12, 2026 05:571,715267,477,440249,499,0007,824,00016,797,696
9Jun 12, 2026 05:571,716266,511,883249,523,0007,893,00016,797,696