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:32Navneet RajNavneet RajScore: 12,553Success
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:3312,5271,889,161,4111,859,208,00019,965,00016,793,600
2Aug 23, 2026 16:3312,5311,889,821,6311,859,772,00019,935,00016,793,600
3Aug 23, 2026 16:3312,5391,891,119,6541,860,923,00019,961,00016,793,600
4Aug 23, 2026 16:3312,5511,893,377,4611,863,361,00019,404,00016,793,600
5Aug 23, 2026 16:3312,5531,894,216,6291,863,116,00019,917,00016,793,600
6Aug 23, 2026 16:3312,5561,893,433,9691,864,199,00019,323,00016,793,600
7Aug 23, 2026 16:3312,6361,905,634,5311,876,334,00019,162,00016,793,600
8Aug 23, 2026 16:3312,6381,905,817,1621,876,495,00019,306,00016,793,600
9Aug 23, 2026 16:3312,6391,905,718,8031,876,925,00018,928,00016,793,600