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 listApr 26, 2026 14:51Victor MerckléVictor MerckléScore: 1,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 14:521,842297,842,233271,368,0005,006,00017,137,664
2Apr 26, 2026 14:521,842293,986,482269,409,0007,010,00017,145,856
3Apr 26, 2026 14:521,844294,711,110269,641,0006,990,00017,149,952
4Apr 26, 2026 14:521,845295,246,743269,761,0006,993,00017,145,856
5Apr 26, 2026 14:521,845290,462,468270,818,0005,995,00017,145,856
6Apr 26, 2026 14:521,847294,717,908271,134,0006,002,00017,018,880
7Apr 26, 2026 14:521,848296,581,366271,321,0006,007,00017,141,760
8Apr 26, 2026 14:521,850292,828,061271,620,0005,991,00017,154,048
9Apr 26, 2026 14:521,854294,138,808271,162,0007,004,00017,154,048