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 13:41Andrew EpsteinAndrew EpsteinScore: 2,090Success
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 13:422,085323,196,699300,037,00012,799,00016,793,600
2Sep 21, 2026 13:422,086323,161,118300,252,00012,674,00016,793,600
3Sep 21, 2026 13:422,087323,356,774300,398,00012,699,00016,793,600
4Sep 21, 2026 13:422,089323,895,915300,560,00012,847,00016,793,600
5Sep 21, 2026 13:422,090324,505,055300,760,00012,808,00016,793,600
6Sep 21, 2026 13:422,090324,347,337300,782,00012,748,00016,793,600
7Sep 21, 2026 13:422,092324,150,482301,161,00012,698,00016,793,600
8Sep 21, 2026 13:422,093324,308,155301,202,00012,785,00016,793,600
9Sep 21, 2026 13:422,099325,800,450302,138,00012,766,00016,793,600