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 27, 2026 12:48Victor MerckléVictor MerckléScore: 1,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 12:491,616252,327,174234,715,0007,805,00016,801,792stderr
2Aug 27, 2026 12:491,617255,510,792234,867,0007,828,00016,801,792stderr
3Aug 27, 2026 12:491,617253,293,970234,799,0007,864,00016,805,888stderr
4Aug 27, 2026 12:491,619253,511,081235,008,0007,970,00016,801,792stderr
5Aug 27, 2026 12:491,619252,688,881234,955,0007,905,00016,801,792stderr
6Aug 27, 2026 12:491,620252,833,969234,963,0008,047,00016,801,792stderr
7Aug 27, 2026 12:491,621253,224,843235,313,0007,979,00016,801,792stderr
8Aug 27, 2026 12:491,622253,207,685235,329,0007,996,00016,801,792stderr
9Aug 27, 2026 12:491,622253,970,859235,333,0007,996,00016,801,792stderr