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 17, 2026 14:25Victor MerckléVictor MerckléScore: 1,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 14:261,673260,639,092243,368,0007,668,00016,797,696
2Jun 17, 2026 14:261,673260,118,702243,432,0007,640,00016,797,696
3Jun 17, 2026 14:261,674261,062,179243,439,0007,699,00016,797,696
4Jun 17, 2026 14:261,674260,484,513243,469,0007,764,00016,797,696
5Jun 17, 2026 14:261,675261,015,003243,509,0007,749,00016,797,696
6Jun 17, 2026 14:261,675260,755,194243,582,0007,751,00016,797,696
7Jun 17, 2026 14:261,678260,880,087244,014,0007,766,00016,797,696
8Jun 17, 2026 14:261,679261,463,221244,202,0007,744,00016,797,696
9Jun 17, 2026 14:261,679261,180,399244,080,0007,772,00016,797,696