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 listMay 18, 2026 04:35M-RochatM-RochatScore: 6,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 04:366,7021,017,047,786988,693,00016,680,00016,793,600
2May 18, 2026 04:366,7061,017,138,320989,452,00016,534,00016,793,600
3May 18, 2026 04:366,7061,017,567,408989,474,00016,526,00016,793,600
4May 18, 2026 04:366,7091,017,613,332989,921,00016,566,00016,793,600
5May 18, 2026 04:366,7111,018,911,766990,366,00016,299,00016,793,600
6May 18, 2026 04:366,7121,018,413,084990,303,00016,588,00016,793,600
7May 18, 2026 04:366,7141,019,315,278990,489,00016,695,00016,793,600
8May 18, 2026 04:366,7151,018,252,288990,597,00016,779,00016,793,600
9May 18, 2026 04:366,7731,028,303,2301,000,660,00015,354,00016,793,600