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 17, 2026 07:38janwwwjanwwwScore: 1,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 07:391,738271,756,490252,713,0008,103,00016,797,696
2Oct 17, 2026 07:391,739271,770,675252,969,0008,001,00016,797,696
3Oct 17, 2026 07:391,740271,910,270252,922,0008,137,00016,797,696
4Oct 17, 2026 07:391,740271,831,446253,198,0007,934,00016,797,696
5Oct 17, 2026 07:391,741271,950,147253,117,0008,073,00016,797,696
6Oct 17, 2026 07:391,741272,449,355253,199,0008,043,00016,797,696
7Oct 17, 2026 07:391,744272,468,848253,568,0008,126,00016,797,696
8Oct 17, 2026 07:391,744272,443,328253,603,0008,126,00016,797,696
9Oct 17, 2026 07:391,745273,380,681253,697,0008,178,00016,797,696