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 23, 2026 16:38Navneet RajNavneet RajScore: 11,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 16:3911,4901,733,694,7581,704,204,00019,391,00016,793,600
2Aug 23, 2026 16:3911,4961,734,456,9831,704,875,00019,642,00016,793,600
3Aug 23, 2026 16:3911,4971,734,490,3841,705,091,00019,462,00016,793,600
4Aug 23, 2026 16:3911,5031,735,449,6341,705,970,00019,540,00016,793,600
5Aug 23, 2026 16:3911,5051,735,776,3361,706,027,00019,795,00016,793,600
6Aug 23, 2026 16:3911,5211,738,163,3481,709,024,00019,259,00016,793,600
7Aug 23, 2026 16:3911,5621,744,277,2061,715,325,00019,014,00016,793,600
8Aug 23, 2026 16:3911,5711,745,702,7441,715,956,00019,695,00016,793,600
9Aug 23, 2026 16:3911,5741,746,088,5831,716,391,00019,810,00016,793,600