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:40olliecrowolliecrowScore: 3,870Success
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:403,868608,803,264569,185,00011,003,00016,982,016
2Mar 4, 2026 19:403,869604,268,096569,361,00010,987,00017,170,432
3Mar 4, 2026 19:403,870605,923,153570,486,0009,991,00017,182,720
4Mar 4, 2026 19:403,870610,131,190568,513,00011,989,00017,166,336
5Mar 4, 2026 19:403,870605,864,021570,543,0009,992,00017,174,528
6Mar 4, 2026 19:403,871607,825,871566,661,00013,991,00017,186,816
7Mar 4, 2026 19:403,872605,835,730572,861,0007,998,00017,002,496
8Mar 4, 2026 19:403,873610,238,562569,921,00010,998,00017,199,104
9Mar 4, 2026 19:403,890609,361,525574,493,0008,992,00017,170,432