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:59Huy Duc LeHuy Duc LeScore: 2,987Success
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:592,974470,961,953422,043,00024,002,00016,998,400
2Oct 31, 2025 15:592,975477,385,964414,177,00032,013,00017,149,952
3Oct 31, 2025 15:592,983475,617,208412,524,00034,959,00017,195,008
4Oct 31, 2025 15:592,985471,708,068419,811,00027,987,00017,133,568
5Oct 31, 2025 15:592,987474,676,582419,103,00029,007,00017,014,784
6Oct 31, 2025 15:592,991476,420,994424,734,00023,984,00017,027,072
7Oct 31, 2025 15:592,992470,481,849421,844,00026,990,00017,195,008
8Oct 31, 2025 15:592,993470,211,824416,924,00031,994,00016,994,304
9Oct 31, 2025 15:592,995479,383,383422,224,00027,014,00016,990,208