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 19, 2026 13:23Andrew EpsteinAndrew EpsteinScore: 4,109Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 13:294,080623,241,216589,431,00022,704,00016,805,888stderr
2Sep 19, 2026 13:294,091624,645,451590,790,00022,954,00016,805,888stderr
3Sep 19, 2026 13:294,096624,829,036590,938,00023,591,00016,801,792stderr
4Sep 19, 2026 13:294,103625,910,417592,119,00023,437,00016,805,888stderr
5Sep 19, 2026 13:294,109626,723,554593,353,00023,061,00016,801,792stderr
6Sep 19, 2026 13:294,112627,375,275593,840,00023,050,00016,805,888stderr
7Sep 19, 2026 13:294,121628,715,276594,737,00023,451,00016,805,888stderr
8Sep 19, 2026 13:294,135630,619,989597,219,00023,075,00016,805,888stderr
9Sep 19, 2026 13:294,152633,250,082599,384,00023,445,00016,805,888stderr