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 16:13Andrew EpsteinAndrew EpsteinScore: 1,614Success
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 16:141,612252,908,714237,785,0004,140,00016,793,600
2Sep 21, 2026 16:141,613253,089,638237,882,0004,162,00016,793,600
3Sep 21, 2026 16:141,613252,821,297237,904,0004,157,00016,793,600
4Sep 21, 2026 16:141,613252,473,647237,756,0004,242,00016,793,600
5Sep 21, 2026 16:141,614253,225,976237,959,0004,202,00016,793,600
6Sep 21, 2026 16:141,614253,088,511237,903,0004,300,00016,793,600
7Sep 21, 2026 16:141,615252,551,298238,085,0004,226,00016,793,600
8Sep 21, 2026 16:141,617253,119,964238,571,0004,099,00016,793,600
9Sep 21, 2026 16:141,617253,571,373238,451,0004,189,00016,793,600