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:42anboto1anboto1Score: 2,994Success
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:432,992458,828,317433,731,00015,070,00016,793,600
2Jul 29, 2026 21:432,992458,896,639433,843,00015,046,00016,793,600
3Jul 29, 2026 21:432,992458,764,622433,809,00015,007,00016,793,600
4Jul 29, 2026 21:432,993459,089,043434,076,00014,958,00016,793,600
5Jul 29, 2026 21:432,994459,182,236434,244,00014,955,00016,793,600
6Jul 29, 2026 21:432,994459,189,135434,111,00015,059,00016,793,600
7Jul 29, 2026 21:433,000460,294,699434,909,00015,175,00016,793,600
8Jul 29, 2026 21:433,000459,984,634434,933,00015,092,00016,793,600
9Jul 29, 2026 21:433,001460,965,064435,008,00015,202,00016,793,600