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 04:57Victor MerckléVictor MerckléScore: 1,658Success
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 04:581,657258,552,804240,762,0007,901,00016,801,792stderr
2Aug 3, 2026 04:581,657258,553,495240,660,0007,907,00016,801,792stderr
3Aug 3, 2026 04:581,658258,599,058240,643,0008,083,00016,801,792stderr
4Aug 3, 2026 04:581,658258,687,805240,800,0007,933,00016,801,792stderr
5Aug 3, 2026 04:581,658258,626,162240,657,0008,079,00016,801,792stderr
6Aug 3, 2026 04:581,658258,677,670240,723,0008,045,00016,801,792stderr
7Aug 3, 2026 04:581,661259,169,716241,306,0007,909,00016,801,792stderr
8Aug 3, 2026 04:581,663259,412,122241,560,0007,961,00016,801,792stderr
9Aug 3, 2026 04:581,664259,498,058241,577,0008,025,00016,801,792stderr