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 listMay 16, 2026 16:45M-RochatM-RochatScore: 4,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 16:464,325658,664,632627,207,00021,585,00016,793,600
2May 16, 2026 16:464,326659,429,410627,696,00021,300,00016,793,600
3May 16, 2026 16:464,328660,715,019627,868,00021,412,00016,793,600
4May 16, 2026 16:464,333659,984,765628,583,00021,415,00016,793,600
5May 16, 2026 16:464,338662,354,127629,197,00021,585,00016,793,600
6May 16, 2026 16:464,341661,865,170628,434,00022,807,00016,793,600
7May 16, 2026 16:464,342660,225,675629,984,00021,354,00016,793,600
8May 16, 2026 16:464,367664,926,272633,919,00021,224,00016,793,600
9May 16, 2026 16:464,426673,183,068642,789,00021,245,00016,793,600