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 10, 2026 05:28olliecrowolliecrowScore: 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
1Mar 10, 2026 05:283,408537,290,464507,263,0004,002,00017,096,704
2Mar 10, 2026 05:283,410545,079,532507,559,0003,996,00017,096,704
3Mar 10, 2026 05:283,410541,599,969507,569,0003,996,00017,027,072
4Mar 10, 2026 05:283,411536,767,926505,602,0005,995,00016,977,920
5Mar 10, 2026 05:283,411537,399,348506,670,0004,996,00017,166,336
6Mar 10, 2026 05:283,412534,987,590505,731,0005,996,00017,035,264
7Mar 10, 2026 05:283,413533,745,982509,927,0001,999,00017,084,416
8Mar 10, 2026 05:283,436538,076,993509,356,0005,992,00017,170,432
9Mar 10, 2026 05:283,446541,797,823510,941,0005,999,00017,186,816