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 6, 2024 16:18Huy Duc LeHuy Duc LeScore: 3,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2024 16:183,062524,827,069459,244,070016,957,440
2Mar 6, 2024 16:183,084532,237,740462,556,318016,961,536
3Mar 6, 2024 16:183,126495,876,913440,890,00027,993,00017,104,896
4Mar 6, 2024 16:183,126496,332,810443,932,00024,996,00017,186,816
5Mar 6, 2024 16:183,127492,076,755432,994,00035,999,00017,125,376
6Mar 6, 2024 16:183,127497,285,704435,023,00034,001,00017,018,880
7Mar 6, 2024 16:183,132526,154,819469,831,506016,961,536
8Mar 6, 2024 16:183,132495,121,806438,772,00030,983,00017,195,008
9Mar 6, 2024 16:183,136501,756,533438,432,00031,958,00016,949,248
10Mar 6, 2024 16:183,137500,027,574442,598,00027,974,00017,022,976
11Mar 6, 2024 16:183,139495,024,929445,880,00024,993,00017,022,976
12Mar 6, 2024 16:183,161508,157,253441,162,00033,012,00017,158,144