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 07:02Victor MerckléVictor MerckléScore: 1,697Success
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 07:031,693263,207,604246,366,0007,732,00016,797,696
2Jun 12, 2026 07:031,694263,273,154246,408,0007,725,00016,797,696
3Jun 12, 2026 07:031,695263,462,227246,541,0007,781,00016,797,696
4Jun 12, 2026 07:031,696263,505,433246,639,0007,785,00016,797,696
5Jun 12, 2026 07:031,697264,136,058246,671,0007,970,00016,797,696
6Jun 12, 2026 07:031,698263,899,539247,083,0007,744,00016,797,696
7Jun 12, 2026 07:031,698263,954,217246,895,0007,896,00016,797,696
8Jun 12, 2026 07:031,700264,244,106247,278,0007,824,00016,797,696
9Jun 12, 2026 07:031,702264,507,328247,426,0007,882,00016,797,696