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 listSep 26, 2026 14:11Kevin HeaveyKevin HeaveyScore: 1,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 14:121,642255,224,213239,983,0006,404,00016,793,600
2Sep 26, 2026 14:121,642255,680,531239,868,0006,537,00016,793,600
3Sep 26, 2026 14:121,643255,360,244240,036,0006,527,00016,793,600
4Sep 26, 2026 14:121,643255,911,707240,134,0006,444,00016,793,600
5Sep 26, 2026 14:121,644255,528,806240,104,0006,555,00016,793,600
6Sep 26, 2026 14:121,644256,499,080240,233,0006,467,00016,793,600
7Sep 26, 2026 14:121,645256,239,043240,405,0006,433,00016,793,600
8Sep 26, 2026 14:121,647255,959,490240,630,0006,467,00016,793,600
9Sep 26, 2026 14:121,648256,731,698240,768,0006,495,00016,793,600