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:56Huy Duc LeHuy Duc LeScore: 2,980Success
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:572,974475,205,433411,122,00035,010,00017,129,472
2Oct 31, 2025 15:562,975476,444,320419,265,00027,017,00017,190,912
3Oct 31, 2025 15:562,980472,860,937419,068,00028,004,00017,133,568
4Oct 31, 2025 15:572,980471,502,308419,062,00028,004,00016,986,112
5Oct 31, 2025 15:562,990475,499,955420,566,00027,971,00017,113,088
6Oct 31, 2025 15:573,001478,662,746425,158,00025,009,00016,986,112