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 listJun 24, 2026 11:23anboto1anboto1Score: 6,471Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 11:246,408971,650,920932,731,00028,474,00016,793,600
2Jun 24, 2026 11:246,426973,312,497935,900,00028,139,00016,793,600
3Jun 24, 2026 11:246,439975,326,790937,534,00028,455,00016,793,600
4Jun 24, 2026 11:246,456977,710,812940,644,00027,869,00016,793,600
5Jun 24, 2026 11:246,471979,966,140942,290,00028,452,00016,793,600
6Jun 24, 2026 11:246,474980,407,012943,017,00028,220,00016,793,600
7Jun 24, 2026 11:246,7301,018,769,945981,621,00027,993,00016,793,600
8Jun 24, 2026 11:246,7511,022,005,044984,990,00027,771,00016,793,600
9Jun 24, 2026 11:246,7581,022,944,178985,604,00028,181,00016,793,600