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 19, 2026 16:33Victor MerckléVictor MerckléScore: 1,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 16:441,657258,427,098240,752,0007,837,00016,801,792stderr
2Aug 19, 2026 16:441,658258,805,995240,886,0007,933,00016,801,792stderr
3Aug 19, 2026 16:441,659258,929,516240,939,0007,939,00016,801,792stderr
4Aug 19, 2026 16:441,659258,784,660240,923,0007,956,00016,801,792stderr
5Aug 19, 2026 16:441,659258,815,173240,999,0007,928,00016,801,792stderr
6Aug 19, 2026 16:441,659258,790,105240,989,0007,937,00016,801,792stderr
7Aug 19, 2026 16:441,661259,094,864241,259,0007,958,00016,801,792stderr
8Aug 19, 2026 16:441,662259,284,445241,321,0008,018,00016,801,792stderr
9Aug 19, 2026 16:441,663259,436,729241,478,0008,015,00016,801,792stderr