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 listAug 24, 2026 14:41Navneet RajNavneet RajScore: 4,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 14:424,080622,063,711598,829,00013,315,00016,793,600
2Aug 24, 2026 14:424,094625,233,941600,675,00013,504,00016,793,600
3Aug 24, 2026 14:424,100626,070,983601,488,00013,530,00016,793,600
4Aug 24, 2026 14:424,101625,218,898601,626,00013,655,00016,793,600
5Aug 24, 2026 14:424,104625,597,091602,195,00013,480,00016,793,600
6Aug 24, 2026 14:424,122628,355,263604,781,00013,642,00016,793,600
7Aug 24, 2026 14:424,134630,091,374606,836,00013,352,00016,793,600
8Aug 24, 2026 14:424,149632,292,509608,660,00013,734,00016,793,600
9Aug 24, 2026 14:424,197639,466,581616,197,00013,366,00016,793,600