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 16, 2026 18:31Jasper EdbrookeJasper EdbrookeScore: 20,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 18:3120,6073,120,712,0952,981,121,000109,930,00017,199,104
2Apr 16, 2026 18:3120,6343,121,319,7272,985,272,000109,899,00017,121,280
3Apr 16, 2026 18:3120,6423,125,212,9422,978,424,000117,898,00017,014,784
4Apr 16, 2026 18:3120,6453,134,706,4052,988,780,000107,919,00017,137,664
5Apr 16, 2026 18:3120,6613,134,980,0962,984,216,000114,892,00017,084,416
6Apr 16, 2026 18:3120,6623,123,363,5482,995,392,000103,944,00017,014,784
7Apr 16, 2026 18:3120,6683,131,060,8112,987,349,000112,899,00016,953,344
8Apr 16, 2026 18:3120,6923,137,045,0042,994,956,000108,889,00017,014,784
9Apr 16, 2026 18:3120,7133,134,172,2512,992,118,000114,889,00017,080,320