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 5, 2026 01:09Victor MerckléVictor MerckléScore: 1,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 01:101,822282,477,414266,439,0006,953,00016,793,600
2Jun 5, 2026 01:101,822282,421,207266,358,0006,994,00016,793,600
3Jun 5, 2026 01:101,823282,579,172266,471,0006,983,00016,793,600
4Jun 5, 2026 01:101,823282,695,502266,393,0007,078,00016,793,600
5Jun 5, 2026 01:101,826283,110,469266,879,0007,073,00016,793,600
6Jun 5, 2026 01:101,828283,470,462267,285,0007,032,00016,793,600
7Jun 5, 2026 01:101,828283,327,552267,295,0007,030,00016,793,600
8Jun 5, 2026 01:101,828283,412,714267,313,0007,007,00016,793,600
9Jun 5, 2026 01:101,829283,717,559267,388,0007,109,00016,793,600