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 26, 2026 14:42Victor MerckléVictor MerckléScore: 2,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 14:432,889449,896,380425,474,0007,990,00017,031,168
2Apr 26, 2026 14:432,892450,111,701428,813,0004,997,00017,199,104
3Apr 26, 2026 14:432,892449,174,326426,813,0006,996,00017,145,856
4Apr 26, 2026 14:432,892450,415,141425,892,0007,997,00017,035,264
5Apr 26, 2026 14:432,893453,270,922427,955,0005,999,00017,158,144
6Apr 26, 2026 14:432,893453,694,072426,017,0008,000,00017,145,856
7Apr 26, 2026 14:432,896451,582,795427,503,0006,991,00017,145,856
8Apr 26, 2026 14:432,898451,425,492428,735,0005,996,00017,031,168
9Apr 26, 2026 14:432,899456,276,940428,925,0005,998,00017,031,168