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 21, 2025 13:15AnSaAnSaScore: 4,003Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2025 13:153,998632,259,906586,715,00012,993,00016,379,904
2Oct 21, 2025 13:153,999626,358,001585,796,00013,995,00016,355,328
3Oct 21, 2025 13:153,999627,299,776583,846,00015,995,00016,191,488
4Oct 21, 2025 13:154,000624,930,655587,947,00011,998,00016,363,520
5Oct 21, 2025 13:154,003624,772,851587,461,00012,988,00016,191,488
6Oct 21, 2025 13:154,003633,104,643588,472,00011,989,00016,359,424
7Oct 21, 2025 13:154,006624,735,956587,888,00012,997,00016,191,488
8Oct 21, 2025 13:154,017629,417,067589,626,00012,991,00016,351,232
9Oct 21, 2025 13:154,064638,432,343594,682,00014,992,00016,359,424