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 listSep 21, 2026 16:22Andrew EpsteinAndrew EpsteinScore: 1,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 16:231,627253,739,772239,835,0004,338,00016,793,600
2Sep 21, 2026 16:231,628253,750,810240,013,0004,252,00016,793,600
3Sep 21, 2026 16:231,628252,888,770239,854,0004,366,00016,793,600
4Sep 21, 2026 16:231,628253,627,242240,135,0004,175,00016,793,600
5Sep 21, 2026 16:231,628253,044,906239,959,0004,362,00016,793,600
6Sep 21, 2026 16:231,630253,348,410240,310,0004,241,00016,793,600
7Sep 21, 2026 16:231,632254,258,822240,408,0004,412,00016,793,600
8Sep 21, 2026 16:231,632253,602,547240,612,0004,247,00016,793,600
9Sep 21, 2026 16:231,634253,940,009240,869,0004,266,00016,793,600