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:24Huy Duc LeHuy Duc LeScore: 2,982Success
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:242,974468,384,949418,094,00028,006,00017,055,744
2Oct 31, 2025 15:242,975470,883,736414,229,00032,017,00017,084,416
3Oct 31, 2025 15:242,979474,688,790417,838,00028,988,00016,998,400
4Oct 31, 2025 15:242,980469,993,510417,956,00028,997,00017,059,840
5Oct 31, 2025 15:242,982476,576,813414,398,00032,952,00017,092,608
6Oct 31, 2025 15:242,982478,429,664418,401,00028,958,00016,982,016
7Oct 31, 2025 15:242,983473,231,371416,474,00030,960,00016,998,400
8Oct 31, 2025 15:242,988473,919,263421,138,00027,008,00016,982,016
9Oct 31, 2025 15:242,992473,800,812425,760,00022,987,00016,994,304