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 listNov 3, 2026 23:32Andrew EpsteinAndrew EpsteinScore: 1,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 23:321,613251,086,437234,840,0007,130,00016,056,320
2Nov 3, 2026 23:321,614251,506,541235,011,0007,218,00016,056,320
3Nov 3, 2026 23:321,614251,520,964235,027,0007,217,00016,056,320
4Nov 3, 2026 23:321,615252,096,565235,236,0007,063,00016,056,320
5Nov 3, 2026 23:321,616253,670,809235,310,0007,223,00016,056,320
6Nov 3, 2026 23:321,617252,391,377234,445,0008,187,00016,056,320
7Nov 3, 2026 23:321,618251,942,094235,753,0007,051,00016,056,320
8Nov 3, 2026 23:321,618252,441,120234,729,0008,023,00016,056,320
9Nov 3, 2026 23:321,621252,820,621235,084,0008,088,00016,056,320