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,983Success
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:562,972473,628,079419,781,00025,986,00017,170,432
2Oct 31, 2025 15:562,973475,514,259415,938,00029,995,00016,994,304
3Oct 31, 2025 15:562,977468,665,967419,634,00026,976,00017,080,320
4Oct 31, 2025 15:562,981472,642,247418,177,00029,012,00016,973,824
5Oct 31, 2025 15:562,983469,618,608423,428,00023,967,00017,195,008
6Oct 31, 2025 15:562,983472,421,714421,552,00025,972,00017,084,416
7Oct 31, 2025 15:562,984468,133,428411,617,00035,966,00017,084,416
8Oct 31, 2025 15:562,991471,929,855420,710,00027,980,00017,059,840
9Oct 31, 2025 15:562,993470,968,232419,966,00028,997,00017,092,608