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:03anboto1anboto1Score: 3,371Success
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:043,358513,834,596478,625,00025,223,00016,793,600
2Jul 29, 2026 21:043,359513,925,781478,695,00025,296,00016,793,600
3Jul 29, 2026 21:043,363514,430,453479,091,00025,473,00016,793,600
4Jul 29, 2026 21:043,366514,886,900479,299,00025,631,00016,793,600
5Jul 29, 2026 21:043,371515,586,272480,479,00025,242,00016,793,600
6Jul 29, 2026 21:043,373515,926,832480,742,00025,245,00016,793,600
7Jul 29, 2026 21:043,374516,253,325480,766,00025,370,00016,793,600
8Jul 29, 2026 21:043,376516,628,357480,966,00025,567,00016,793,600
9Jul 29, 2026 21:043,377516,684,285480,976,00025,650,00016,793,600