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 06:11Victor MerckléVictor MerckléScore: 1,711Success
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 06:121,708265,494,275248,712,0007,636,00016,797,696
2Jun 12, 2026 06:121,709265,581,945248,739,0007,742,00016,797,696
3Jun 12, 2026 06:121,709265,431,325248,763,0007,601,00016,797,696
4Jun 12, 2026 06:121,710265,632,848248,920,0007,657,00016,797,696
5Jun 12, 2026 06:121,711265,912,794248,913,0007,834,00016,797,696
6Jun 12, 2026 06:121,712265,963,204249,109,0007,749,00016,797,696
7Jun 12, 2026 06:121,715266,374,102249,657,0007,712,00016,797,696
8Jun 12, 2026 06:121,716266,680,809249,729,0007,808,00016,797,696
9Jun 12, 2026 06:121,717266,720,340249,830,0007,816,00016,797,696