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 listOct 21, 2026 00:24e1011e1011Score: 77,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 00:2677,45311,629,576,34211,612,604,0005,397,00016,793,600
2Oct 21, 2026 00:2677,61811,654,660,12811,637,216,0005,606,00016,793,600
3Oct 21, 2026 00:2677,69711,665,944,68311,650,234,0004,351,00016,793,600
4Oct 21, 2026 00:2677,70611,666,894,61411,651,486,0004,507,00016,793,600
5Oct 21, 2026 00:2677,81911,685,087,40711,668,416,0004,444,00016,793,600
6Oct 21, 2026 00:2677,89311,695,889,20611,677,698,0006,400,00016,793,600
7Oct 21, 2026 00:2678,18511,738,692,83711,723,315,0004,454,00016,793,600
8Oct 21, 2026 00:2678,49311,784,969,75411,769,553,0004,497,00016,793,600
9Oct 21, 2026 00:2678,52911,790,239,07311,774,990,0004,370,00016,793,600