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 5, 2026 05:34DanielDanielScore: 4,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2026 05:344,070637,604,785598,492,00011,989,00017,092,608
2Mar 5, 2026 05:344,073638,314,873591,885,00018,996,00016,949,248
3Mar 5, 2026 05:344,077637,725,311598,499,00012,989,00017,166,336
4Mar 5, 2026 05:344,079640,645,930593,813,00017,994,00017,022,976
5Mar 5, 2026 05:344,079634,720,292597,921,00013,998,00017,203,200
6Mar 5, 2026 05:344,086640,410,653596,883,00015,996,00016,977,920
7Mar 5, 2026 05:344,086636,288,319596,957,00015,998,00016,949,248
8Mar 5, 2026 05:344,087635,541,476589,037,00024,001,00017,174,528
9Mar 5, 2026 05:344,099640,521,301597,890,00016,996,00017,006,592