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:44Huy Duc LeHuy Duc LeScore: 3,218Success
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:442,996478,542,336417,455,00031,958,00016,998,400
2Oct 31, 2025 14:442,998473,252,774421,685,00027,979,00017,170,432
3Oct 31, 2025 14:443,000473,670,368421,960,00027,997,00017,158,144
4Oct 31, 2025 14:443,218505,320,217456,757,00025,986,00016,994,304
5Oct 31, 2025 14:443,220505,572,929454,948,00027,996,00017,100,800
6Oct 31, 2025 14:443,224510,950,574454,575,00028,972,00017,170,432