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 listAug 31, 2026 11:27Tomislav TunkovicTomislav TunkovicScore: 1,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 11:271,705266,079,807246,337,0009,502,00016,031,744stderr
2Aug 31, 2026 11:271,709267,518,024247,029,0009,451,00016,031,744stderr
3Aug 31, 2026 11:271,715267,421,961248,093,0009,271,00016,031,744stderr
4Aug 31, 2026 11:271,715267,612,486247,925,0009,456,00016,031,744stderr
5Aug 31, 2026 11:271,720268,165,988248,637,0009,445,00016,031,744stderr
6Aug 31, 2026 11:271,721268,297,690248,974,0009,281,00016,031,744stderr
7Aug 31, 2026 11:271,724268,644,839249,161,0009,452,00016,031,744stderr
8Aug 31, 2026 11:271,729269,311,240249,985,0009,410,00016,031,744stderr
9Aug 31, 2026 11:271,730270,303,921250,100,0009,453,00016,031,744stderr