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:11Victor 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 16:121,662258,542,598241,786,0007,642,00016,797,696
2Jun 17, 2026 16:121,662258,519,375241,754,0007,673,00016,797,696
3Jun 17, 2026 16:121,663258,561,964241,862,0007,632,00016,797,696
4Jun 17, 2026 16:121,663258,570,737241,743,0007,751,00016,797,696
5Jun 17, 2026 16:121,664259,148,119241,893,0007,769,00016,797,696
6Jun 17, 2026 16:121,664258,651,365241,905,0007,702,00016,797,696
7Jun 17, 2026 16:121,668259,346,599242,481,0007,739,00016,797,696
8Jun 17, 2026 16:121,668259,387,071242,515,0007,760,00016,797,696
9Jun 17, 2026 16:121,669259,683,600242,593,0007,889,00016,797,696