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 29, 2026 04:57olliecrowolliecrowScore: 3,185Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 04:573,173483,114,812472,041,0004,000,00017,186,816
2Apr 29, 2026 04:573,174483,295,469472,181,0004,001,00016,994,304
3Apr 29, 2026 04:573,182497,325,316473,328,0004,002,00016,994,304
4Apr 29, 2026 04:573,183483,748,210471,542,0005,994,00016,986,112
5Apr 29, 2026 04:573,185484,968,864471,833,0005,997,00017,010,688
6Apr 29, 2026 04:573,187494,171,441473,069,0005,000,00017,010,688
7Apr 29, 2026 04:573,189484,461,436474,446,0004,003,00017,014,784
8Apr 29, 2026 04:573,195485,611,618472,357,0006,990,00017,006,592
9Apr 29, 2026 04:573,322505,448,554494,389,0004,003,00017,235,968