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 13:41AnSaAnSaScore: 3,837Success
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 13:413,836604,048,732570,478,0004,995,00016,195,584
2Oct 21, 2025 13:413,837608,289,608571,521,0003,996,00016,171,008
3Oct 21, 2025 13:413,837613,947,779570,601,0004,996,00016,191,488
4Oct 21, 2025 13:413,837599,718,631571,615,0003,997,00016,429,056
5Oct 21, 2025 13:413,837603,202,324572,619,0002,998,00016,175,104
6Oct 21, 2025 13:413,838604,381,283571,639,0003,997,00016,195,584
7Oct 21, 2025 13:413,838607,352,644570,684,0004,997,00016,191,488
8Oct 21, 2025 13:413,838602,077,908570,709,0004,997,00016,191,488
9Oct 21, 2025 13:413,838604,497,136570,766,0004,997,00016,195,584