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:40Huy Duc LeHuy Duc LeScore: 3,067Success
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:403,064482,152,243430,666,00028,977,00017,076,224
2Oct 31, 2025 15:403,067482,820,410427,059,00033,004,00017,022,976
3Oct 31, 2025 15:403,067486,027,566432,110,00028,007,00016,982,016