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 listApr 30, 2026 11:38Charles CabergsCharles CabergsScore: 3,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 11:393,818594,058,506566,736,0006,007,00017,133,568
2Apr 30, 2026 11:393,818591,119,564566,734,0005,997,00017,219,584
3Apr 30, 2026 11:393,818592,610,704565,849,0006,998,00017,129,472
4Apr 30, 2026 11:393,820592,405,970567,145,0006,001,00017,137,664
5Apr 30, 2026 11:393,821589,187,840567,261,0006,002,00017,129,472
6Apr 30, 2026 11:393,821589,694,258564,184,0009,002,00017,137,664
7Apr 30, 2026 11:393,822595,320,901567,304,0006,003,00017,133,568
8Apr 30, 2026 11:393,855595,265,592570,366,0007,991,00017,121,280
9Apr 30, 2026 11:393,991633,156,686591,710,0006,961,00016,990,208