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 28, 2026 08:48TudyMTudyMScore: 5,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:485,569855,000,819800,419,00034,974,00017,141,760
2Apr 28, 2026 08:485,569850,735,039803,417,00031,976,00017,108,992
3Apr 28, 2026 08:485,588859,230,169808,284,00029,973,00017,084,416
4Apr 28, 2026 08:485,592858,361,210799,944,00038,997,00017,145,856
5Apr 28, 2026 08:485,601857,634,649807,315,00032,972,00017,129,472
6Apr 28, 2026 08:485,610859,189,558807,577,00033,982,00017,166,336
7Apr 28, 2026 08:485,631868,482,993810,805,00033,991,00017,149,952
8Apr 28, 2026 08:485,784888,148,167836,747,00030,990,00017,154,048
9Apr 28, 2026 08:485,841897,431,568843,237,00032,970,00017,145,856