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 listMar 26, 2026 20:19Dominique GarmierDominique GarmierScore: 101,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 20:49101,54615,265,642,87015,207,904,00023,987,00017,051,648
2Mar 26, 2026 20:13101,56615,272,376,56515,214,879,00019,989,00017,195,008
3Mar 26, 2026 20:19101,57315,267,695,08515,209,009,00026,985,00017,031,168
4Mar 26, 2026 20:13101,60815,276,370,73015,220,246,00020,987,00017,022,976
5Mar 26, 2026 20:49101,61315,277,061,96815,222,022,00019,986,00016,977,920
6Mar 26, 2026 20:19101,62315,281,157,76415,220,457,00022,987,00016,986,112
7Mar 26, 2026 20:13101,75115,299,062,20615,247,669,00014,992,00017,022,976
8Mar 26, 2026 20:49101,76015,298,586,87615,241,047,00022,989,00017,027,072
9Mar 26, 2026 20:19101,80515,315,917,65615,253,736,00016,990,00016,977,920