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 listSep 21, 2026 14:02Andrew EpsteinAndrew EpsteinScore: 1,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 14:021,937300,877,851277,904,00012,710,00016,793,600
2Sep 21, 2026 14:021,939301,407,931278,232,00012,751,00016,793,600
3Sep 21, 2026 14:021,939302,205,859278,270,00012,694,00016,793,600
4Sep 21, 2026 14:021,939301,864,079278,275,00012,657,00016,793,600
5Sep 21, 2026 14:021,941301,577,922278,554,00012,655,00016,793,600
6Sep 21, 2026 14:021,942301,687,461278,615,00012,764,00016,793,600
7Sep 21, 2026 14:021,943301,876,238278,849,00012,740,00016,793,600
8Sep 21, 2026 14:021,944304,930,730278,890,00012,847,00016,793,600
9Sep 21, 2026 14:021,956303,808,348279,311,00014,109,00016,793,600