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:55Huy Duc LeHuy Duc LeScore: 2,981Success
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:552,974472,707,897420,140,00026,008,00016,986,112
2Oct 31, 2025 15:552,976473,202,627412,429,00033,953,00017,006,592
3Oct 31, 2025 15:552,977476,083,531416,544,00029,967,00017,080,320
4Oct 31, 2025 15:552,978476,063,129415,759,00030,982,00017,162,240
5Oct 31, 2025 15:552,981474,862,008417,139,00030,010,00017,072,128
6Oct 31, 2025 15:552,990476,651,532419,506,00028,965,00017,002,496
7Oct 31, 2025 15:552,990476,856,835422,508,00025,969,00016,990,208
8Oct 31, 2025 15:552,991472,014,199421,663,00026,978,00017,076,224
9Oct 31, 2025 15:553,016476,298,239416,459,00035,953,00016,986,112