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 listJun 18, 2026 20:28Victor MerckléVictor MerckléScore: 1,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 20:291,651256,845,195239,943,0007,844,00016,797,696
2Jun 18, 2026 20:291,651256,862,788239,919,0007,831,00016,797,696
3Jun 18, 2026 20:291,652256,963,226239,907,0007,915,00016,797,696
4Jun 18, 2026 20:291,652257,021,898240,034,0007,880,00016,797,696
5Jun 18, 2026 20:291,654257,558,761240,216,0007,959,00016,797,696
6Jun 18, 2026 20:291,654257,381,532240,231,0007,991,00016,797,696
7Jun 18, 2026 20:291,657257,807,185240,664,0007,922,00016,797,696
8Jun 18, 2026 20:291,659258,023,010240,915,0007,948,00016,797,696
9Jun 18, 2026 20:291,659258,098,789240,977,0007,998,00016,797,696