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:24Victor MerckléVictor MerckléScore: 1,647Success
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:251,645256,715,048238,972,0007,850,00016,801,792stderr
2Aug 27, 2026 12:251,646256,931,825239,015,0007,932,00016,801,792stderr
3Aug 27, 2026 12:251,647257,000,059239,169,0007,917,00016,801,792stderr
4Aug 27, 2026 12:251,647257,729,321239,212,0007,987,00016,801,792stderr
5Aug 27, 2026 12:251,647257,017,671239,215,0007,941,00016,801,792stderr
6Aug 27, 2026 12:251,648257,329,931238,837,0008,429,00016,801,792stderr
7Aug 27, 2026 12:251,649257,413,486239,531,0007,953,00016,801,792stderr
8Aug 27, 2026 12:251,650257,434,711239,691,0007,931,00016,801,792stderr
9Aug 27, 2026 12:251,650257,541,550239,602,0008,002,00016,801,792stderr