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 10, 2026 03:20Andrew EpsteinAndrew EpsteinScore: 3,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 03:213,283502,646,654469,864,00022,716,00016,793,600
2Sep 10, 2026 03:213,289503,514,654470,632,00022,725,00016,793,600
3Sep 10, 2026 03:213,290504,426,149470,691,00022,863,00016,793,600
4Sep 10, 2026 03:213,291503,747,885470,915,00022,750,00016,793,600
5Sep 10, 2026 03:213,294504,201,545471,129,00023,015,00016,793,600
6Sep 10, 2026 03:213,296504,714,108471,093,00023,354,00016,793,600
7Sep 10, 2026 03:213,298504,663,549472,025,00022,677,00016,793,600
8Sep 10, 2026 03:213,302506,129,207471,915,00023,407,00016,793,600
9Sep 10, 2026 03:213,310506,799,440472,961,00023,664,00016,793,600