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 listJul 29, 2026 19:18anboto1anboto1Score: 2,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 19:182,500385,337,104360,177,00014,892,00016,793,600
2Jul 29, 2026 19:182,502385,654,634360,402,00015,008,00016,793,600
3Jul 29, 2026 19:182,502385,566,691360,490,00014,886,00016,793,600
4Jul 29, 2026 19:182,505386,156,709360,592,00015,263,00016,793,600
5Jul 29, 2026 19:182,505385,977,141360,374,00015,393,00016,793,600
6Jul 29, 2026 19:182,505386,809,610360,576,00015,274,00016,793,600
7Jul 29, 2026 19:182,509387,298,229361,484,00014,982,00016,793,600
8Jul 29, 2026 19:182,509387,310,902361,411,00014,946,00016,793,600
9Jul 29, 2026 19:182,510386,937,135361,534,00014,995,00016,793,600