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:34Victor MerckléVictor MerckléScore: 1,648Success
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:351,646256,950,646238,926,0008,053,00016,801,792stderr
2Aug 3, 2026 12:351,648257,089,920239,204,0008,038,00016,801,792stderr
3Aug 3, 2026 12:351,648257,238,767239,243,0008,023,00016,801,792stderr
4Aug 3, 2026 12:351,648257,208,582239,187,0008,104,00016,801,792stderr
5Aug 3, 2026 12:351,648257,207,724239,137,0008,121,00016,801,792stderr
6Aug 3, 2026 12:351,649257,263,381239,254,0008,127,00016,801,792stderr
7Aug 3, 2026 12:351,652257,841,757239,840,0008,106,00016,801,792stderr
8Aug 3, 2026 12:351,654258,234,285239,988,0008,242,00016,801,792stderr
9Aug 3, 2026 12:351,655258,517,736240,132,0008,143,00016,801,792stderr