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 listAug 17, 2026 05:09marko1597marko1597Score: 2,446Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 11:27Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 05:512,444376,751,699361,321,0005,392,00016,801,792stderr
2Aug 17, 2026 05:512,444376,669,158361,332,0005,363,00016,801,792stderr
3Aug 17, 2026 05:512,445376,755,260361,448,0005,346,00016,801,792stderr
4Aug 17, 2026 05:512,445376,836,034361,554,0005,338,00016,801,792stderr
5Aug 17, 2026 05:512,446377,085,431360,705,0006,284,00016,801,792stderr
6Aug 17, 2026 05:512,446376,968,725361,682,0005,326,00016,801,792stderr
7Aug 17, 2026 05:512,449377,476,871362,226,0005,239,00016,801,792stderr
8Aug 17, 2026 05:512,450377,502,366362,344,0005,233,00016,801,792stderr
9Aug 17, 2026 05:512,451377,680,193362,520,0005,226,00016,801,792stderr