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 12:15anboto1anboto1Score: 3,163Success
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 12:153,150481,733,138447,432,00025,082,00016,793,600
2Jun 24, 2026 12:153,157482,829,209447,673,00025,986,00016,793,600
3Jun 24, 2026 12:153,157482,822,640448,320,00025,260,00016,793,600
4Jun 24, 2026 12:153,162483,523,789449,217,00025,141,00016,793,600
5Jun 24, 2026 12:153,163484,024,922447,966,00026,574,00016,793,600
6Jun 24, 2026 12:153,164483,793,245448,710,00025,918,00016,793,600
7Jun 24, 2026 12:153,164483,838,426449,178,00025,510,00016,793,600
8Jun 24, 2026 12:153,166484,146,493449,919,00025,112,00016,793,600
9Jun 24, 2026 12:153,168484,305,697449,784,00025,475,00016,793,600