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 16:44Navneet RajNavneet RajScore: 3,163Success
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 16:453,154483,178,657465,803,0007,392,00016,793,600
2Aug 25, 2026 16:453,156483,222,274465,910,0007,518,00016,793,600
3Aug 25, 2026 16:453,157483,479,715466,225,0007,398,00016,793,600
4Aug 25, 2026 16:453,162484,092,913466,792,0007,575,00016,793,600
5Aug 25, 2026 16:453,163484,438,211467,088,0007,502,00016,793,600
6Aug 25, 2026 16:453,176487,010,294468,957,0007,564,00016,793,600
7Aug 25, 2026 16:453,189488,361,644470,887,0007,521,00016,793,600
8Aug 25, 2026 16:453,191488,612,357471,117,0007,608,00016,793,600
9Aug 25, 2026 16:453,202490,253,739472,820,0007,584,00016,793,600