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 16:43anboto1anboto1Score: 3,039Success
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 16:443,033465,060,650447,746,0007,263,00016,793,600
2Jul 29, 2026 16:443,036465,497,380448,568,0006,850,00016,793,600
3Jul 29, 2026 16:443,037465,649,205448,534,0007,132,00016,793,600
4Jul 29, 2026 16:443,038466,238,490448,852,0006,914,00016,793,600
5Jul 29, 2026 16:443,039466,022,728448,921,0007,056,00016,793,600
6Jul 29, 2026 16:443,040466,144,585449,098,0007,018,00016,793,600
7Jul 29, 2026 16:443,041466,137,654449,110,0007,041,00016,793,600
8Jul 29, 2026 16:443,050468,868,320450,812,0006,789,00016,793,600
9Jul 29, 2026 16:443,056468,618,723451,525,0006,908,00016,793,600