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 23, 2026 15:45Dominique GarmierDominique GarmierScore: 4,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 15:454,006623,663,624579,833,00020,993,00016,953,344
2Mar 23, 2026 15:454,009628,208,705578,371,00022,975,00017,149,952
3Mar 23, 2026 15:454,014627,882,558573,066,00029,003,00017,154,048
4Mar 23, 2026 15:454,015629,812,459581,299,00020,974,00017,162,240
5Mar 23, 2026 15:454,016636,270,953577,407,00024,974,00017,145,856
6Mar 23, 2026 15:454,016624,316,900571,429,00030,969,00017,158,144
7Mar 23, 2026 15:454,017632,168,779571,632,00030,980,00017,145,856
8Mar 23, 2026 15:454,020636,676,710581,013,00022,000,00017,096,704
9Mar 23, 2026 15:454,027634,908,256577,108,00027,005,00017,022,976