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:07anboto1anboto1Score: 3,031Success
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:073,025464,288,938446,908,0006,858,00016,793,600
2Jul 29, 2026 16:073,029464,397,612447,592,0006,902,00016,793,600
3Jul 29, 2026 16:073,029464,798,355446,700,0007,692,00016,793,600
4Jul 29, 2026 16:073,030464,555,822447,756,0006,849,00016,793,600
5Jul 29, 2026 16:073,031464,710,095447,937,0006,847,00016,793,600
6Jul 29, 2026 16:073,032464,816,736447,890,0006,929,00016,793,600
7Jul 29, 2026 16:073,032465,202,348447,918,0006,886,00016,793,600
8Jul 29, 2026 16:073,033465,445,200448,123,0006,887,00016,793,600
9Jul 29, 2026 16:073,050468,255,461450,711,0006,933,00016,793,600