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 13:48Huy Duc LeHuy Duc LeScore: 2,987Success
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 13:482,980470,822,899420,975,00025,998,00016,986,112
2Oct 31, 2025 13:482,982472,827,776420,215,00027,013,00016,990,208
3Oct 31, 2025 13:482,982472,578,531424,393,00022,967,00017,002,496
4Oct 31, 2025 13:482,984470,907,480416,681,00030,976,00017,158,144
5Oct 31, 2025 13:482,987471,538,020421,020,00027,001,00016,990,208
6Oct 31, 2025 13:482,989477,936,183418,443,00029,960,00017,010,688
7Oct 31, 2025 13:482,990474,402,158412,542,00035,960,00017,022,976
8Oct 31, 2025 13:482,993470,035,937423,023,00026,001,00017,088,512
9Oct 31, 2025 13:483,002474,656,505423,365,00026,959,00016,977,920