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 24, 2026 09:26anboto1anboto1Score: 12,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 09:2712,7211,917,556,0451,870,909,00037,264,00016,793,600
2Jun 24, 2026 09:2712,7551,922,581,7051,876,657,00036,615,00016,793,600
3Jun 24, 2026 09:2712,7861,927,141,2611,882,035,00035,901,00016,793,600
4Jun 24, 2026 09:2712,8151,931,687,8141,886,159,00036,183,00016,793,600
5Jun 24, 2026 09:2712,8441,935,954,9731,890,470,00036,269,00016,793,600
6Jun 24, 2026 09:2713,5422,040,632,6321,993,710,00037,714,00016,793,600
7Jun 24, 2026 09:2713,5632,043,719,3471,996,379,00038,139,00016,793,600
8Jun 24, 2026 09:2713,5942,048,577,1592,001,844,00037,396,00016,793,600
9Jun 24, 2026 09:2713,6452,055,982,0432,008,759,00038,018,00016,793,600