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:32Victor MerckléVictor MerckléScore: 1,680Success
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:331,678261,009,880244,140,0007,698,00016,797,696
2Jun 12, 2026 07:331,679261,048,337244,299,0007,684,00016,797,696
3Jun 12, 2026 07:331,680261,097,465244,315,0007,733,00016,797,696
4Jun 12, 2026 07:331,680261,224,242244,381,0007,724,00016,797,696
5Jun 12, 2026 07:331,680261,214,018244,384,0007,755,00016,797,696
6Jun 12, 2026 07:331,680261,257,540244,315,0007,795,00016,797,696
7Jun 12, 2026 07:331,684261,731,845244,943,0007,785,00016,797,696
8Jun 12, 2026 07:331,685262,043,101245,040,0007,834,00016,797,696
9Jun 12, 2026 07:331,685261,911,714244,949,0007,823,00016,797,696