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 listMar 7, 2024 02:53Huy Duc LeHuy Duc LeScore: 3,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 02:532,949506,013,650442,360,079016,961,536
2Mar 7, 2024 02:532,949508,042,931442,404,985016,969,728
3Mar 7, 2024 02:532,953531,304,604442,987,467016,969,728
4Mar 7, 2024 02:532,999476,605,482413,930,00035,993,00017,014,784
5Mar 7, 2024 02:533,000476,856,538415,031,00035,002,00017,100,800
6Mar 7, 2024 02:533,003479,100,230421,494,00028,965,00017,108,992
7Mar 7, 2024 02:533,004474,714,261424,585,00025,974,00017,014,784
8Mar 7, 2024 02:533,004479,634,919418,667,00031,974,00017,014,784
9Mar 7, 2024 02:533,005473,653,436419,705,00030,978,00017,031,168
10Mar 7, 2024 02:533,006473,522,034418,941,00031,995,00017,203,200
11Mar 7, 2024 02:533,007475,491,988423,093,00028,006,00017,027,072
12Mar 7, 2024 02:533,007473,309,619424,114,00027,007,00017,022,976