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 17:11Victor MerckléVictor MerckléScore: 1,658Success
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 17:121,657257,645,037240,918,0007,668,00016,797,696
2Jun 17, 2026 17:121,657257,813,015241,026,0007,633,00016,797,696
3Jun 17, 2026 17:121,657257,834,730240,983,0007,690,00016,797,696
4Jun 17, 2026 17:121,658257,892,956241,060,0007,723,00016,797,696
5Jun 17, 2026 17:121,658257,949,368241,092,0007,682,00016,797,696
6Jun 17, 2026 17:121,658257,890,367241,012,0007,693,00016,797,696
7Jun 17, 2026 17:121,663258,595,931241,737,0007,713,00016,797,696
8Jun 17, 2026 17:121,663258,556,973241,808,0007,696,00016,797,696
9Jun 17, 2026 17:121,664258,708,392241,693,0007,911,00016,797,696