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 listFeb 16, 2026 17:55Valentin KofmanValentin KofmanScore: 7,061Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 17:557,0541,089,445,0611,043,176,00014,988,00016,961,536
2Feb 16, 2026 17:547,0551,085,690,2691,042,274,00015,973,00016,957,440
3Feb 16, 2026 17:547,0561,081,552,3571,037,451,00020,968,00016,998,400
4Feb 16, 2026 17:557,0611,087,091,6011,041,215,00017,986,00017,178,624
5Feb 16, 2026 17:547,0641,089,973,3371,045,675,00013,982,00017,022,976
6Feb 16, 2026 17:557,0641,088,634,0361,044,576,00014,979,00017,002,496