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 listApr 29, 2026 11:38Dominique GarmierDominique GarmierScore: 3,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 11:393,271504,690,894463,773,00026,986,00017,137,664
2Apr 29, 2026 11:393,273506,978,959465,014,00026,000,00017,141,760
3Apr 29, 2026 11:393,279509,559,298464,865,00026,992,00017,158,144
4Apr 29, 2026 11:393,281506,515,109472,242,00020,010,00017,137,664
5Apr 29, 2026 11:393,282511,905,068465,348,00026,962,00017,145,856
6Apr 29, 2026 11:393,283509,853,134466,492,00025,971,00017,133,568
7Apr 29, 2026 11:393,287511,359,934470,052,00023,002,00017,203,200
8Apr 29, 2026 11:393,290512,111,621463,663,00029,978,00017,137,664
9Apr 29, 2026 11:393,292515,932,672466,900,00026,994,00016,990,208