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 listOct 21, 2025 12:02AnSaAnSaScore: 4,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2025 12:024,080633,457,597596,028,00016,000,00017,145,856
2Oct 21, 2025 12:024,080635,266,900587,035,00025,001,00016,973,824
3Oct 21, 2025 12:024,083642,552,651593,445,00018,982,00017,117,184
4Oct 21, 2025 12:024,085635,713,132593,716,00018,990,00017,039,360
5Oct 21, 2025 12:024,089636,383,472596,311,00017,008,00017,084,416
6Oct 21, 2025 12:024,099638,036,296596,821,00017,994,00017,072,128
7Oct 21, 2025 12:024,112637,666,217597,778,00018,992,00017,133,568
8Oct 21, 2025 12:024,172649,135,994612,821,00012,996,00017,018,880
9Oct 21, 2025 12:024,204650,475,610609,669,00020,988,00017,068,032