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 listFeb 16, 2026 18:20Valentin KofmanValentin KofmanScore: 3,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 18:203,864605,189,066567,628,00011,992,00017,010,688
2Feb 16, 2026 18:203,865602,773,916568,728,00010,994,00017,035,264
3Feb 16, 2026 18:203,867604,729,558571,047,0009,000,00017,182,720
4Feb 16, 2026 18:203,868612,551,261569,192,00010,984,00017,113,088
5Feb 16, 2026 18:203,871605,092,321571,635,0008,994,00017,190,912
6Feb 16, 2026 18:203,873606,392,369570,887,0009,998,00017,088,512
7Feb 16, 2026 18:203,873609,390,294571,955,0008,999,00016,953,344
8Feb 16, 2026 18:203,874608,812,397571,106,00010,001,00017,178,624
9Feb 16, 2026 18:203,874607,138,852571,124,00010,002,00017,158,144