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 4, 2026 19:28olliecrowolliecrowScore: 3,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 19:283,866613,254,914571,871,0007,998,00016,953,344
2Mar 4, 2026 19:283,867603,448,614570,111,00010,001,00017,174,528
3Mar 4, 2026 19:283,868610,002,526568,154,00011,982,00017,080,320
4Mar 4, 2026 19:283,870607,717,533572,490,0007,992,00017,068,032
5Mar 4, 2026 19:283,870611,712,874566,543,00013,988,00017,178,624
6Mar 4, 2026 19:283,870610,526,464570,567,0009,992,00017,084,416
7Mar 4, 2026 19:283,873613,976,654570,892,0009,998,00017,186,816
8Mar 4, 2026 19:283,894611,037,490575,060,0009,000,00017,170,432
9Mar 4, 2026 19:283,911616,025,393576,712,0009,995,00017,108,992