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 listOct 15, 2026 22:31izotoffizotoffScore: 4,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 22:344,200642,019,554620,650,0009,459,00016,818,176
2Oct 15, 2026 22:344,200642,000,587620,706,0009,408,00016,818,176
3Oct 15, 2026 22:344,222645,450,848623,899,0009,544,00016,818,176
4Oct 15, 2026 22:344,231646,851,592625,529,0009,249,00016,818,176
5Oct 15, 2026 22:344,231646,710,291624,034,00010,676,00016,818,176
6Oct 15, 2026 22:344,234646,523,155624,607,00010,616,00016,818,176
7Oct 15, 2026 22:344,234648,015,679624,190,00010,989,00016,818,176
8Oct 15, 2026 22:344,240647,765,625625,658,00010,360,00016,818,176
9Oct 15, 2026 22:344,246648,313,758627,660,0009,383,00016,818,176