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 17:22Andrew EpsteinAndrew EpsteinScore: 1,590Success
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 17:221,588247,721,380233,951,0004,367,00016,793,600
2Sep 21, 2026 17:221,589247,849,715233,972,0004,404,00016,793,600
3Sep 21, 2026 17:221,589247,756,149233,971,0004,385,00016,793,600
4Sep 21, 2026 17:221,589247,806,457234,155,0004,240,00016,793,600
5Sep 21, 2026 17:221,590248,031,861234,234,0004,266,00016,793,600
6Sep 21, 2026 17:221,591248,302,689234,529,0004,252,00016,793,600
7Sep 21, 2026 17:221,592248,221,169234,632,0004,248,00016,793,600
8Sep 21, 2026 17:221,593247,854,399234,903,0004,092,00016,793,600
9Sep 21, 2026 17:221,593248,440,661234,760,0004,262,00016,793,600