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:06Victor MerckléVictor MerckléScore: 1,712Success
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:071,710265,718,022248,806,0007,808,00016,797,696
2Jun 12, 2026 06:071,711265,859,380249,125,0007,641,00016,797,696
3Jun 12, 2026 06:071,711265,867,464248,917,0007,748,00016,797,696
4Jun 12, 2026 06:071,712266,614,635249,160,0007,692,00016,797,696
5Jun 12, 2026 06:071,712266,191,029249,204,0007,738,00016,797,696
6Jun 12, 2026 06:071,713266,049,001249,213,0007,749,00016,797,696
7Jun 12, 2026 06:071,716266,716,678249,809,0007,708,00016,797,696
8Jun 12, 2026 06:071,718267,170,746249,928,0007,829,00016,797,696
9Jun 12, 2026 06:071,719266,964,385250,083,0007,772,00016,797,696