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 listJul 1, 2026 05:20Victor MerckléVictor MerckléScore: 1,652Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 05:211,650257,064,419239,711,0007,890,00016,801,792stderr
2Jul 1, 2026 05:211,650257,021,043239,645,0007,906,00016,801,792stderr
3Jul 1, 2026 05:211,650256,992,813239,762,0007,876,00016,801,792stderr
4Jul 1, 2026 05:211,651257,119,009239,776,0007,892,00016,801,792stderr
5Jul 1, 2026 05:211,652257,223,189239,898,0007,951,00016,801,792stderr
6Jul 1, 2026 05:211,652257,195,728239,909,0007,938,00016,801,792stderr
7Jul 1, 2026 05:211,656257,869,786240,556,0007,939,00016,801,792stderr
8Jul 1, 2026 05:211,658258,170,534240,775,0007,997,00016,801,792stderr
9Jul 1, 2026 05:211,658258,129,066240,708,0008,027,00016,801,792stderr