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 22, 2026 01:49olliecrowolliecrowScore: 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 22, 2026 01:523,408518,488,474507,344,0004,002,00017,137,664
2Apr 22, 2026 01:523,410518,796,044504,613,0006,994,00017,068,032
3Apr 22, 2026 01:523,410518,507,711506,545,0004,995,00017,068,032
4Apr 22, 2026 01:523,410518,649,289505,635,0006,007,00017,174,528
5Apr 22, 2026 01:523,411518,727,056507,725,0003,997,00017,170,432
6Apr 22, 2026 01:523,411518,813,016507,759,0003,998,00017,002,496
7Apr 22, 2026 01:523,412519,044,794508,917,0002,999,00017,068,032
8Apr 22, 2026 01:523,413518,941,900508,971,0002,999,00017,002,496
9Apr 22, 2026 01:523,417518,777,070507,684,0004,996,00017,174,528