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 24, 2026 13:19anboto1anboto1Score: 3,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 13:203,130478,681,764444,128,00025,373,00016,793,600
2Jun 24, 2026 13:203,135479,466,574445,081,00025,257,00016,793,600
3Jun 24, 2026 13:203,135479,498,567444,668,00025,674,00016,793,600
4Jun 24, 2026 13:203,138479,886,893445,133,00025,666,00016,793,600
5Jun 24, 2026 13:203,140480,232,359445,672,00025,390,00016,793,600
6Jun 24, 2026 13:203,141480,271,551445,831,00025,372,00016,793,600
7Jun 24, 2026 13:203,143481,272,088446,325,00025,253,00016,793,600
8Jun 24, 2026 13:203,145481,018,133446,870,00025,012,00016,793,600
9Jun 24, 2026 13:203,151482,201,435447,125,00025,551,00016,793,600