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 15, 2026 16:36Haha ExpertHaha ExpertScore: 4,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 16:394,637707,153,278686,448,0009,141,00016,793,600
2Sep 15, 2026 16:394,646707,226,583687,733,0009,186,00016,793,600
3Sep 15, 2026 16:394,651707,866,914688,531,0009,143,00016,793,600
4Sep 15, 2026 16:394,654708,400,805688,870,0009,257,00016,793,600
5Sep 15, 2026 16:394,656708,696,394689,288,0009,182,00016,793,600
6Sep 15, 2026 16:394,658709,117,360689,206,0009,521,00016,793,600
7Sep 15, 2026 16:394,658708,973,705689,624,0009,150,00016,793,600
8Sep 15, 2026 16:394,660709,180,510689,885,0009,157,00016,793,600
9Sep 15, 2026 16:394,662709,710,622690,154,0009,237,00016,793,600