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:20Huy Duc LeHuy Duc LeScore: 2,988Success
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:202,980474,156,495420,977,00025,998,00017,170,432
2Oct 31, 2025 14:202,983474,023,999416,516,00030,964,00017,006,592
3Oct 31, 2025 14:202,984469,322,453421,657,00025,978,00016,998,400
4Oct 31, 2025 14:202,985470,580,955415,835,00031,987,00017,055,744
5Oct 31, 2025 14:202,988480,006,213416,215,00032,016,00017,002,496
6Oct 31, 2025 14:202,991471,893,802422,667,00025,979,00017,014,784
7Oct 31, 2025 14:202,991475,233,501413,726,00034,976,00017,117,184
8Oct 31, 2025 14:202,996474,837,007420,436,00028,961,00016,969,728
9Oct 31, 2025 14:203,002476,195,159423,316,00026,956,00017,141,760