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:12Navneet RajNavneet RajScore: 4,035Success
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:134,017612,544,337593,749,0008,900,00016,793,600
2Aug 24, 2026 14:134,023613,607,706594,620,0008,955,00016,793,600
3Aug 24, 2026 14:134,024613,589,002594,690,0008,982,00016,793,600
4Aug 24, 2026 14:134,024613,548,852594,656,0008,959,00016,793,600
5Aug 24, 2026 14:134,035615,191,642596,396,0009,001,00016,793,600
6Aug 24, 2026 14:134,046616,816,252598,097,0008,908,00016,793,600
7Aug 24, 2026 14:134,047617,202,646598,117,0009,021,00016,793,600
8Aug 24, 2026 14:134,049618,649,351598,415,0009,030,00016,793,600
9Aug 24, 2026 14:134,053617,896,316598,882,0009,093,00016,793,600