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 19, 2026 08:52olliecrowolliecrowScore: 3,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 08:523,409537,926,016507,309,0004,002,00017,047,552
2Apr 19, 2026 08:523,409537,678,700508,343,0003,002,00017,121,280
3Apr 19, 2026 08:523,409540,979,453507,374,0004,002,00017,108,992
4Apr 19, 2026 08:523,410537,751,584508,574,0002,997,00017,154,048
5Apr 19, 2026 08:523,411540,697,525506,582,0004,995,00017,043,456
6Apr 19, 2026 08:523,412537,722,258506,759,0004,997,00017,043,456
7Apr 19, 2026 08:523,414542,312,119510,086,0002,000,00017,199,104
8Apr 19, 2026 08:523,415543,036,389508,318,0004,002,00017,031,168
9Apr 19, 2026 08:523,417536,256,689507,565,0004,995,00017,035,264