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 3, 2026 12:47Victor 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 3, 2026 12:491,638255,591,181237,849,0007,892,00016,801,792stderr
2Aug 3, 2026 12:491,638255,732,658237,690,0008,070,00016,801,792stderr
3Aug 3, 2026 12:491,639256,573,052238,022,0007,930,00016,801,792stderr
4Aug 3, 2026 12:491,642259,027,948238,280,0008,115,00016,801,792stderr
5Aug 3, 2026 12:491,642256,182,511238,289,0008,024,00016,801,792stderr
6Aug 3, 2026 12:491,643256,466,432238,543,0007,976,00016,801,792stderr
7Aug 3, 2026 12:491,643257,207,583238,391,0008,157,00016,801,792stderr
8Aug 3, 2026 12:491,644256,519,328238,605,0007,995,00016,801,792stderr
9Aug 3, 2026 12:491,644256,545,970238,614,0007,996,00016,801,792stderr