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 12:00anboto1anboto1Score: 4,081Success
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 12:014,070619,874,954537,485,00073,082,00016,797,696
2Jun 24, 2026 12:014,074620,853,626536,683,00074,423,00016,801,792
3Jun 24, 2026 12:014,079623,197,711538,040,00073,890,00016,797,696
4Jun 24, 2026 12:014,080621,765,260537,648,00074,449,00016,801,792
5Jun 24, 2026 12:014,081621,896,029536,483,00075,709,00016,801,792
6Jun 24, 2026 12:014,082622,191,290539,589,00072,858,00016,801,792
7Jun 24, 2026 12:014,086622,659,041539,416,00073,490,00016,801,792
8Jun 24, 2026 12:014,095624,171,913538,215,00076,181,00016,801,792
9Jun 24, 2026 12:014,127628,798,845541,433,00077,671,00016,801,792