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 listAug 31, 2025 17:44Yuriy LyfenkoYuriy LyfenkoScore: 3,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2025 17:383,926614,347,849565,918,00022,996,00017,088,512
2Aug 31, 2025 17:383,927611,993,989565,996,00022,999,00016,973,824
3Aug 31, 2025 17:383,927614,105,116567,018,00022,000,00017,051,648
4Aug 31, 2025 17:383,927613,852,714565,081,00024,003,00017,174,528
5Aug 31, 2025 17:383,928617,658,438564,130,00025,005,00016,961,536
6Aug 31, 2025 17:383,928621,845,943566,232,00023,009,00017,043,456
7Aug 31, 2025 17:383,929616,541,299565,370,00023,973,00016,969,728
8Aug 31, 2025 17:443,929615,201,234566,321,00022,972,00017,117,184
9Aug 31, 2025 17:383,930611,191,419566,541,00022,981,00016,941,056
10Aug 31, 2025 17:443,930613,099,554567,527,00021,981,00016,969,728
11Aug 31, 2025 17:443,930613,599,167567,543,00021,982,00016,961,536
12Aug 31, 2025 17:383,931616,573,771566,610,00022,984,00016,961,536