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 listJul 29, 2026 15:36anboto1anboto1Score: 2,931Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 15:372,928449,446,231432,505,0006,839,00016,793,600
2Jul 29, 2026 15:372,929449,450,902432,563,0006,886,00016,793,600
3Jul 29, 2026 15:372,930450,779,038432,780,0006,862,00016,793,600
4Jul 29, 2026 15:372,931449,772,218432,910,0006,843,00016,793,600
5Jul 29, 2026 15:372,931449,794,976432,754,0006,914,00016,793,600
6Jul 29, 2026 15:372,932450,063,122433,018,0006,897,00016,793,600
7Jul 29, 2026 15:372,935450,427,171433,373,0006,916,00016,793,600
8Jul 29, 2026 15:372,937450,843,037433,602,0007,036,00016,793,600
9Jul 29, 2026 15:372,937450,595,520433,798,0006,840,00016,793,600