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 listAug 24, 2026 14:10Navneet RajNavneet RajScore: 4,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 14:104,011611,726,001592,729,0009,007,00016,793,600
2Aug 24, 2026 14:104,011611,671,437592,778,0009,000,00016,793,600
3Aug 24, 2026 14:104,018612,775,963593,864,0008,953,00016,793,600
4Aug 24, 2026 14:104,020612,908,304594,155,0008,879,00016,793,600
5Aug 24, 2026 14:104,020613,107,960594,043,0009,028,00016,793,600
6Aug 24, 2026 14:104,024613,686,435594,532,0009,100,00016,793,600
7Aug 24, 2026 14:104,027614,065,556595,093,0009,020,00016,793,600
8Aug 24, 2026 14:104,028614,123,452595,252,0008,986,00016,793,600
9Aug 24, 2026 14:104,032614,900,057595,893,0008,965,00016,793,600