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 20:24anboto1anboto1Score: 3,901Success
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 20:253,897594,982,734571,994,00012,648,00016,797,696
2Jul 29, 2026 20:253,900596,015,681572,242,00012,846,00016,797,696
3Jul 29, 2026 20:253,900595,143,105572,306,00012,753,00016,793,600
4Jul 29, 2026 20:253,901596,173,999572,433,00012,829,00016,797,696
5Jul 29, 2026 20:253,901596,074,679572,495,00012,667,00016,797,696
6Jul 29, 2026 20:253,901595,562,485572,505,00012,760,00016,797,696
7Jul 29, 2026 20:253,901596,095,260572,496,00012,726,00016,797,696
8Jul 29, 2026 20:253,902596,266,299572,706,00012,720,00016,797,696
9Jul 29, 2026 20:253,904596,604,269572,982,00012,765,00016,793,600