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 listApr 26, 2026 14:39Victor MerckléVictor MerckléScore: 3,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 14:403,005470,511,319443,861,0006,997,00017,096,704
2Apr 26, 2026 14:403,007469,809,928443,110,0007,983,00017,096,704
3Apr 26, 2026 14:403,009468,909,449442,459,0008,989,00017,104,896
4Apr 26, 2026 14:403,011469,126,354443,763,0007,995,00017,100,800
5Apr 26, 2026 14:403,011469,529,981446,717,0004,996,00017,051,648
6Apr 26, 2026 14:403,013469,198,856445,006,0007,000,00017,096,704
7Apr 26, 2026 14:403,015469,838,372445,258,0007,004,00017,096,704
8Apr 26, 2026 14:403,015470,834,198444,384,0007,988,00017,055,744
9Apr 26, 2026 14:403,024471,961,511447,727,0005,996,00017,092,608