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 19:24anboto1anboto1Score: 23,520Success
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 19:2521,9483,302,385,3853,268,111,00024,204,00016,793,600
2Jul 29, 2026 19:2523,3033,505,851,6953,468,481,00027,020,00016,793,600
3Jul 29, 2026 19:2523,3513,512,759,7963,477,851,00024,901,00016,793,600
4Jul 29, 2026 19:2523,3833,517,545,9883,482,756,00024,702,00016,793,600
5Jul 29, 2026 19:2523,5203,538,588,8803,503,184,00024,819,00016,793,600
6Jul 29, 2026 19:2523,6923,563,892,6373,529,452,00024,355,00016,793,600
7Jul 29, 2026 19:2523,7263,569,067,2473,534,421,00024,583,00016,793,600
8Jul 29, 2026 19:2524,8423,736,644,7963,701,071,00025,322,00016,793,600
9Jul 29, 2026 19:2526,2093,941,528,6113,906,666,00024,735,00016,793,600