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:25Huy Duc LeHuy Duc LeScore: 2,981Success
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:252,971470,313,363412,616,00032,969,00017,203,200
2Oct 31, 2025 15:252,973471,805,200420,921,00024,995,00017,002,496
3Oct 31, 2025 15:252,976472,606,611416,479,00029,962,00016,982,016
4Oct 31, 2025 15:252,979469,231,646416,926,00029,994,00016,990,208
5Oct 31, 2025 15:252,981473,210,516418,166,00029,011,00017,195,008
6Oct 31, 2025 15:252,985472,264,239413,817,00033,985,00017,076,224
7Oct 31, 2025 15:252,986474,409,775416,932,00030,994,00016,973,824
8Oct 31, 2025 15:252,990477,027,280425,458,00022,970,00017,088,512
9Oct 31, 2025 15:252,992477,459,448417,878,00030,990,00016,986,112