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:55Huy Duc LeHuy Duc LeScore: 9,009Success
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:557,5651,160,378,0511,113,836,00020,978,00017,072,128
2Oct 31, 2025 14:559,0091,376,903,1081,328,378,00022,989,00017,195,008
3Oct 31, 2025 14:559,1161,390,625,4711,340,363,00027,007,00017,076,224