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 listApr 29, 2026 11:37Dominique GarmierDominique GarmierScore: 3,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 11:383,270509,705,867466,649,00023,981,00017,145,856
2Apr 29, 2026 11:383,274508,728,420465,178,00026,009,00017,149,952
3Apr 29, 2026 11:383,274509,722,587466,144,00025,007,00017,141,760
4Apr 29, 2026 11:383,275514,065,972464,358,00026,962,00017,154,048
5Apr 29, 2026 11:383,278510,431,407470,809,00020,991,00016,998,400
6Apr 29, 2026 11:383,279512,840,937462,960,00028,997,00017,137,664
7Apr 29, 2026 11:383,280511,108,616465,060,00027,003,00017,145,856
8Apr 29, 2026 11:383,285507,290,241462,775,00029,985,00017,141,760
9Apr 29, 2026 11:383,289510,441,819465,491,00027,969,00017,158,144