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 24, 2026 14:08Navneet RajNavneet RajScore: 4,128Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 11:27Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 14:094,119627,818,421609,105,0008,889,00016,793,600
2Aug 24, 2026 14:094,121628,115,704609,267,0008,888,00016,793,600
3Aug 24, 2026 14:094,123628,356,129609,485,0008,966,00016,793,600
4Aug 24, 2026 14:094,126628,886,803609,978,0008,939,00016,793,600
5Aug 24, 2026 14:094,128629,275,544610,313,0008,986,00016,793,600
6Aug 24, 2026 14:094,129629,253,935610,460,0008,913,00016,793,600
7Aug 24, 2026 14:094,129629,325,156610,441,0008,933,00016,793,600
8Aug 24, 2026 14:094,136632,363,434611,347,0009,112,00016,793,600
9Aug 24, 2026 14:094,138630,763,918611,860,0008,976,00016,793,600