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 10, 2026 05:23olliecrowolliecrowScore: 3,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 05:233,409538,765,187507,417,0004,003,00016,969,728
2Mar 10, 2026 05:233,411537,350,073507,659,0003,997,00016,945,152
3Mar 10, 2026 05:233,413538,561,316507,017,0005,000,00017,133,568
4Mar 10, 2026 05:233,414533,820,043508,029,0004,000,00016,982,016
5Mar 10, 2026 05:233,414533,305,050507,143,0005,001,00017,080,320
6Mar 10, 2026 05:233,415542,761,167509,293,0003,001,00017,166,336
7Mar 10, 2026 05:233,417543,949,647509,491,0002,997,00016,961,536
8Mar 10, 2026 05:233,420535,471,785508,031,0005,000,00017,129,472
9Mar 10, 2026 05:233,438542,878,669509,708,0005,996,00016,961,536