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 10:48anboto1anboto1Score: 4,570Success
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 10:494,564693,849,297659,287,00025,381,00016,793,600
2Jun 24, 2026 10:494,566694,106,583659,557,00025,360,00016,793,600
3Jun 24, 2026 10:494,566694,069,480659,486,00025,420,00016,793,600
4Jun 24, 2026 10:494,568694,540,557659,540,00025,809,00016,793,600
5Jun 24, 2026 10:494,570694,984,179659,785,00025,749,00016,793,600
6Jun 24, 2026 10:494,571699,156,311659,951,00025,716,00016,793,600
7Jun 24, 2026 10:494,571694,929,578660,765,00024,909,00016,793,600
8Jun 24, 2026 10:494,571694,955,268660,234,00025,533,00016,793,600
9Jun 24, 2026 10:494,593698,252,099663,373,00025,636,00016,793,600