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 7, 2026 19:58Karthik ReddyKarthik ReddyScore: 1,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 19:581,584246,717,853231,996,0005,727,00016,793,600
2Oct 7, 2026 19:581,584246,736,749232,892,0004,754,00016,793,600
3Oct 7, 2026 19:581,585247,405,534232,034,0005,842,00016,793,600
4Oct 7, 2026 19:581,586246,975,075232,218,0005,755,00016,793,600
5Oct 7, 2026 19:581,586246,966,242232,163,0005,795,00016,793,600
6Oct 7, 2026 19:581,588247,914,417231,862,0006,487,00016,793,600
7Oct 7, 2026 19:581,592248,039,978232,987,0005,882,00016,793,600
8Oct 7, 2026 19:581,600249,211,098234,311,0005,836,00016,793,600
9Oct 7, 2026 19:581,602253,998,292234,544,0005,854,00016,793,600