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 13, 2026 21:21Aleksei ShahoikaAleksei ShahoikaScore: 5,199Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 21:225,192788,205,288770,838,0007,989,00016,793,600
2May 13, 2026 21:225,193790,737,684771,121,0007,917,00016,793,600
3May 13, 2026 21:225,194789,876,073771,153,0008,031,00016,793,600
4May 13, 2026 21:225,194790,198,165771,220,0007,993,00016,793,600
5May 13, 2026 21:225,199790,789,642772,008,0007,990,00016,793,600
6May 13, 2026 21:225,208790,765,508773,114,0008,142,00016,793,600
7May 13, 2026 21:225,280800,759,334784,083,0007,956,00016,793,600
8May 13, 2026 21:225,281801,990,218784,148,0008,019,00016,793,600
9May 13, 2026 21:225,281803,013,672784,286,0007,936,00016,793,600