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 25, 2026 12:47Navneet RajNavneet RajScore: 3,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 12:473,254498,038,474478,531,0009,604,00016,793,600
2Aug 25, 2026 12:473,256498,431,124479,053,0009,495,00016,793,600
3Aug 25, 2026 12:473,257498,427,487479,093,0009,546,00016,793,600
4Aug 25, 2026 12:473,258498,630,223479,250,0009,597,00016,793,600
5Aug 25, 2026 12:473,259498,814,773479,729,0009,208,00016,793,600
6Aug 25, 2026 12:473,262499,238,034480,265,0009,161,00016,793,600
7Aug 25, 2026 12:473,263499,426,559479,891,0009,654,00016,793,600
8Aug 25, 2026 12:473,264500,259,284480,395,0009,225,00016,793,600
9Aug 25, 2026 12:473,266499,844,344480,761,0009,270,00016,793,600