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 14:07Huy Duc LeHuy Duc LeScore: 2,986Success
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 14:072,981469,796,112417,094,00030,006,00016,982,016
2Oct 31, 2025 14:072,982474,130,539418,268,00029,018,00016,953,344
3Oct 31, 2025 14:072,985470,541,199418,720,00028,980,00017,137,664
4Oct 31, 2025 14:072,985474,986,099422,810,00024,988,00016,973,824
5Oct 31, 2025 14:072,986473,255,175423,836,00023,990,00017,170,432
6Oct 31, 2025 14:072,986468,661,633416,876,00030,990,00016,998,400
7Oct 31, 2025 14:072,987476,055,166419,066,00029,004,00016,998,400
8Oct 31, 2025 14:072,990476,175,105416,487,00031,960,00016,957,440
9Oct 31, 2025 14:072,992471,898,689419,856,00028,990,00017,080,320