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 15:22Navneet RajNavneet RajScore: 4,063Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 15:224,053617,883,285599,018,0009,011,00016,793,600
2Aug 24, 2026 15:224,054618,048,832599,205,0008,956,00016,793,600
3Aug 24, 2026 15:224,059618,732,970599,883,0009,007,00016,793,600
4Aug 24, 2026 15:224,062619,191,538600,313,0009,005,00016,793,600
5Aug 24, 2026 15:224,063619,324,752600,576,0008,985,00016,793,600
6Aug 24, 2026 15:224,063619,483,260600,560,0009,029,00016,793,600
7Aug 24, 2026 15:224,065622,684,015600,694,0009,114,00016,793,600
8Aug 24, 2026 15:224,068620,166,228601,274,0009,038,00016,793,600
9Aug 24, 2026 15:224,069620,342,701601,456,0009,008,00016,793,600