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 09:56anboto1anboto1Score: 58,177Success
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 09:5757,5348,639,958,0028,565,630,00064,617,00017,616,896
2Jun 24, 2026 09:5757,7218,667,673,4378,594,997,00063,156,00017,387,520
3Jun 24, 2026 09:5757,8338,684,868,3828,604,704,00070,338,00017,477,632
4Jun 24, 2026 09:5758,1068,727,621,6288,647,685,00068,305,00017,522,688
5Jun 24, 2026 09:5758,1778,736,377,3778,658,360,00068,312,00017,444,864
6Jun 24, 2026 09:5758,1798,737,574,5748,657,958,00068,965,00017,539,072
7Jun 24, 2026 09:5759,4298,925,536,5478,842,750,00071,642,00017,530,880
8Jun 24, 2026 09:5759,5168,936,998,3588,859,344,00068,139,00017,444,864
9Jun 24, 2026 09:5759,9108,996,024,1978,917,881,00068,658,00017,453,056