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 listApr 17, 2026 21:16olliecrowolliecrowScore: 3,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2026 14:483,407532,618,246508,027,0003,000,00017,190,912
2Apr 17, 2026 21:163,410535,679,982509,557,0001,998,00017,170,432
3Apr 17, 2026 21:193,413534,597,343508,996,0002,999,00017,100,800
4Apr 8, 2026 14:483,414533,046,947508,031,0004,000,00017,174,528
5Apr 8, 2026 14:483,415543,053,735510,224,0002,000,00017,186,816
6Apr 17, 2026 21:193,415533,348,994509,206,0003,001,00016,998,400
7Apr 17, 2026 21:163,417540,925,682508,494,0003,996,00016,965,632
8Apr 17, 2026 21:163,417534,923,705508,623,0003,997,00017,108,992
9Apr 17, 2026 21:193,420539,104,467508,061,0005,000,00017,018,880