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 21:21anboto1anboto1Score: 3,276Success
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 21:213,274501,014,125478,025,00013,085,00016,793,600
2Jul 29, 2026 21:213,274501,140,403478,211,00012,952,00016,793,600
3Jul 29, 2026 21:213,275502,570,785478,416,00012,897,00016,793,600
4Jul 29, 2026 21:213,275501,351,074478,261,00013,058,00016,793,600
5Jul 29, 2026 21:213,276501,464,612478,534,00012,993,00016,793,600
6Jul 29, 2026 21:213,277501,712,350478,665,00012,990,00016,793,600
7Jul 29, 2026 21:213,277501,570,266478,476,00013,076,00016,793,600
8Jul 29, 2026 21:213,278501,741,096478,613,00013,157,00016,793,600
9Jul 29, 2026 21:213,279501,974,178478,735,00013,168,00016,793,600