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:11Andrew EpsteinAndrew EpsteinScore: 1,622Success
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:121,621253,584,020239,016,0004,197,00016,793,600
2Sep 21, 2026 16:121,621253,474,266239,018,0004,159,00016,793,600
3Sep 21, 2026 16:121,621253,628,018239,156,0004,134,00016,793,600
4Sep 21, 2026 16:121,622254,390,214239,175,0004,155,00016,793,600
5Sep 21, 2026 16:121,622256,157,567239,150,0004,222,00016,793,600
6Sep 21, 2026 16:121,623254,427,156239,154,0004,314,00016,793,600
7Sep 21, 2026 16:121,623254,248,356239,374,0004,198,00016,793,600
8Sep 21, 2026 16:121,624253,968,016239,472,0004,191,00016,793,600
9Sep 21, 2026 16:121,624253,962,592239,444,0004,301,00016,793,600