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 13:26Navneet RajNavneet RajScore: 3,133Success
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 13:273,130479,475,320462,164,0007,390,00016,793,600
2Aug 25, 2026 13:273,130479,323,768462,094,0007,409,00016,793,600
3Aug 25, 2026 13:273,132479,835,082462,409,0007,486,00016,793,600
4Aug 25, 2026 13:273,132479,768,645462,388,0007,457,00016,793,600
5Aug 25, 2026 13:273,133479,919,801462,363,0007,642,00016,793,600
6Aug 25, 2026 13:273,135480,905,873462,941,0007,417,00016,793,600
7Aug 25, 2026 13:273,136480,569,775462,794,0007,664,00016,793,600
8Aug 25, 2026 13:273,150482,302,367465,117,0007,406,00016,793,600
9Aug 25, 2026 13:273,160484,059,722466,357,0007,769,00016,793,600