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 listJun 19, 2026 13:11Victor MerckléVictor MerckléScore: 1,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 13:121,649256,523,627239,481,0007,925,00016,797,696
2Jun 19, 2026 13:121,649256,543,804239,614,0007,851,00016,797,696
3Jun 19, 2026 13:121,650256,720,620239,674,0007,920,00016,797,696
4Jun 19, 2026 13:121,650256,696,926239,713,0007,871,00016,797,696
5Jun 19, 2026 13:121,650256,744,165239,686,0007,918,00016,797,696
6Jun 19, 2026 13:121,651256,912,760239,737,0007,969,00016,797,696
7Jun 19, 2026 13:121,654257,335,724240,246,0007,919,00016,797,696
8Jun 19, 2026 13:121,654257,247,516240,223,0007,942,00016,797,696
9Jun 19, 2026 13:121,656257,586,314240,538,0007,995,00016,797,696