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:55Victor MerckléVictor MerckléScore: 1,639Success
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:551,638254,126,743237,776,0008,015,00016,801,792stderr
2Aug 3, 2026 12:551,638254,262,284237,835,0007,929,00016,801,792stderr
3Aug 3, 2026 12:551,638254,608,431237,847,0007,952,00016,801,792stderr
4Aug 3, 2026 12:551,639254,524,765238,021,0007,916,00016,801,792stderr
5Aug 3, 2026 12:551,639254,364,216237,708,0008,148,00016,801,792stderr
6Aug 3, 2026 12:551,640254,513,730238,026,0008,087,00016,801,792stderr
7Aug 3, 2026 12:551,641255,996,770238,108,0008,139,00016,801,792stderr
8Aug 3, 2026 12:551,641254,495,770238,244,0008,026,00016,801,792stderr
9Aug 3, 2026 12:551,642254,779,658238,341,0008,013,00016,801,792stderr