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 listMar 19, 2024 04:35Huy Duc LeHuy Duc LeScore: 2,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2024 04:352,954504,663,484443,093,789016,957,440
2Mar 19, 2024 04:352,960505,661,523444,010,723016,957,440
3Mar 19, 2024 04:352,961504,102,933444,145,772016,949,248
4Mar 19, 2024 04:352,989478,667,931419,444,00028,961,00017,125,376
5Mar 19, 2024 04:352,995480,244,304423,296,00026,018,00016,977,920
6Mar 19, 2024 04:352,996480,297,202415,508,00033,959,00017,158,144
7Mar 19, 2024 04:352,997476,402,149420,600,00028,972,00017,035,264
8Mar 19, 2024 04:353,001478,188,869419,173,00031,012,00017,018,880
9Mar 19, 2024 04:353,003480,906,008413,510,00036,956,00017,014,784
10Mar 19, 2024 04:353,005477,806,358423,706,00026,981,00017,084,416
11Mar 19, 2024 04:353,006474,043,901414,846,00035,986,00017,014,784
12Mar 19, 2024 04:353,007472,431,299414,086,00037,007,00017,002,496