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:12Andrew 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:131,613252,352,158237,852,0004,168,00016,793,600
2Sep 21, 2026 16:131,613252,328,027237,695,0004,316,00016,793,600
3Sep 21, 2026 16:131,614253,026,212237,953,0004,163,00016,793,600
4Sep 21, 2026 16:131,614253,086,459237,984,0004,172,00016,793,600
5Sep 21, 2026 16:131,614253,253,105237,957,0004,224,00016,793,600
6Sep 21, 2026 16:131,614253,250,842237,944,0004,211,00016,793,600
7Sep 21, 2026 16:131,617253,568,707238,455,0004,199,00016,793,600
8Sep 21, 2026 16:131,617253,701,855238,492,0004,200,00016,793,600
9Sep 21, 2026 16:131,618253,050,957238,528,0004,188,00016,793,600