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 listNov 14, 2025 16:04izotoffizotoffScore: 371,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2025 16:04368,81755,391,105,65955,173,662,000148,918,00017,113,088
2Nov 14, 2025 16:04369,44055,477,412,88255,301,082,000114,931,00016,990,208
3Nov 14, 2025 16:04370,35655,616,458,84655,490,410,00062,963,00017,186,816
4Nov 14, 2025 16:04371,39955,765,943,66455,584,842,000124,938,00016,961,536
5Nov 14, 2025 16:04371,83855,838,330,71355,641,843,000133,929,00017,207,296
6Nov 14, 2025 16:04372,87855,992,259,31155,881,714,00049,969,00017,096,704
7Nov 14, 2025 16:04373,41656,088,213,03855,914,529,00097,939,00016,994,304
8Nov 14, 2025 16:04374,11156,178,171,74556,006,642,000109,938,00016,994,304
9Nov 14, 2025 16:04376,37956,515,510,49256,385,896,00070,953,00017,158,144