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 listJun 19, 2026 04:31Victor MerckléVictor MerckléScore: 1,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 04:321,648256,451,679239,457,0007,875,00016,797,696
2Jun 19, 2026 04:321,649256,564,248239,450,0008,039,00016,797,696
3Jun 19, 2026 04:321,650257,050,843239,666,0007,881,00016,797,696
4Jun 19, 2026 04:321,650256,720,455239,635,0007,938,00016,797,696
5Jun 19, 2026 04:321,650256,730,208239,591,0008,002,00016,797,696
6Jun 19, 2026 04:321,650256,590,612239,632,0007,895,00016,797,696
7Jun 19, 2026 04:321,653257,143,543240,135,0007,918,00016,797,696
8Jun 19, 2026 04:321,653257,116,063240,137,0007,903,00016,797,696
9Jun 19, 2026 04:321,655257,617,407240,393,0007,982,00016,797,696