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 19, 2025 19:33Aleksei ShahoikaAleksei ShahoikaScore: 17,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2025 19:3317,4422,643,674,6562,580,434,00035,936,00017,031,168
2Oct 19, 2025 19:3317,8302,706,035,4732,645,574,00028,940,00016,965,632
3Oct 19, 2025 19:3317,8472,707,133,7312,641,097,00035,919,00017,063,936
4Oct 19, 2025 19:3317,8932,721,105,5572,652,982,00030,941,00016,961,536
5Oct 19, 2025 19:3317,9112,723,590,5402,652,762,00033,933,00017,096,704
6Oct 19, 2025 19:3318,0492,740,827,5492,676,399,00030,935,00017,186,816
7Oct 19, 2025 19:3318,1312,754,355,9802,689,703,00029,941,00016,969,728
8Oct 19, 2025 19:3318,1702,759,016,4282,699,509,00025,947,00017,051,648
9Oct 19, 2025 19:3318,2172,763,773,0542,699,605,00032,934,00016,961,536