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 listMar 4, 2026 19:15olliecrowolliecrowScore: 9,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 19:159,6581,476,711,2511,434,742,00013,978,00016,965,632
2Mar 4, 2026 19:159,6601,483,152,5081,435,044,00013,971,00016,990,208
3Mar 4, 2026 19:159,6621,482,503,6821,437,356,00011,977,00017,059,840
4Mar 4, 2026 19:159,6671,477,747,1771,437,104,00012,973,00016,965,632
5Mar 4, 2026 19:159,6781,479,029,1071,438,741,00012,979,00016,965,632
6Mar 4, 2026 19:159,6901,481,657,4971,445,444,0007,985,00017,047,552
7Mar 4, 2026 19:159,7201,484,079,3291,446,082,00011,975,00017,047,552
8Mar 4, 2026 19:159,7341,487,963,4981,450,136,0009,980,00017,121,280
9Mar 4, 2026 19:159,7701,491,951,7661,454,477,00010,980,00017,141,760