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 19, 2026 15:12Victor MerckléVictor MerckléScore: 1,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 15:131,639255,790,664238,012,0007,897,00016,801,792stderr
2Aug 19, 2026 15:131,640255,964,782238,025,0007,987,00016,801,792stderr
3Aug 19, 2026 15:131,640256,048,979238,119,0007,956,00016,801,792stderr
4Aug 19, 2026 15:131,640256,050,571238,177,0007,956,00016,801,792stderr
5Aug 19, 2026 15:131,642258,015,964238,396,0007,952,00016,801,792stderr
6Aug 19, 2026 15:131,643256,839,355238,560,0007,970,00016,801,792stderr
7Aug 19, 2026 15:131,644256,672,756238,719,0007,998,00016,801,792stderr
8Aug 19, 2026 15:131,644256,457,179238,586,0008,023,00016,801,792stderr
9Aug 19, 2026 15:131,730280,422,210250,709,0008,895,00016,801,792stderr