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 31, 2025 15:21Huy Duc LeHuy Duc LeScore: 2,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2025 15:212,972468,697,743418,758,00026,984,00017,051,648
2Oct 31, 2025 15:212,976468,884,643417,446,00028,961,00017,063,936
3Oct 31, 2025 15:212,980473,234,221412,063,00035,005,00017,018,880
4Oct 31, 2025 15:212,981468,025,086413,132,00034,010,00016,986,112
5Oct 31, 2025 15:212,982472,021,769424,316,00023,017,00017,182,720
6Oct 31, 2025 15:212,983474,204,713417,479,00029,962,00016,969,728
7Oct 31, 2025 15:212,986473,140,270425,887,00021,994,00017,002,496
8Oct 31, 2025 15:212,989480,849,711419,457,00028,962,00016,990,208
9Oct 31, 2025 15:212,993475,542,495413,978,00034,998,00017,162,240