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 22:02anboto1anboto1Score: 3,118Success
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 22:033,098474,827,738439,056,00025,792,00016,793,600
2Jul 29, 2026 22:033,111476,845,405441,237,00025,551,00016,793,600
3Jul 29, 2026 22:033,112477,019,054440,897,00025,972,00016,793,600
4Jul 29, 2026 22:033,116477,793,508441,888,00025,590,00016,793,600
5Jul 29, 2026 22:033,118477,817,498441,788,00025,990,00016,793,600
6Jul 29, 2026 22:033,121478,315,898442,766,00025,511,00016,793,600
7Jul 29, 2026 22:033,125478,892,526443,037,00025,811,00016,793,600
8Jul 29, 2026 22:033,130479,623,755443,812,00025,810,00016,793,600
9Jul 29, 2026 22:033,132479,823,763443,825,00025,980,00016,793,600