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 12, 2026 06:17Victor MerckléVictor MerckléScore: 1,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 06:181,697263,709,776246,909,0007,749,00016,797,696
2Jun 12, 2026 06:181,698263,878,248247,060,0007,746,00016,797,696
3Jun 12, 2026 06:181,699264,143,135247,096,0007,823,00016,797,696
4Jun 12, 2026 06:181,699264,065,535247,115,0007,805,00016,797,696
5Jun 12, 2026 06:181,700264,245,846247,263,0007,789,00016,797,696
6Jun 12, 2026 06:181,703264,588,663247,750,0007,786,00016,797,696
7Jun 12, 2026 06:181,703264,729,861247,143,0008,422,00016,797,696
8Jun 12, 2026 06:181,703264,694,062247,861,0007,729,00016,797,696
9Jun 12, 2026 06:181,703264,652,933247,853,0007,716,00016,797,696