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 listAug 31, 2025 17:42Yuriy LyfenkoYuriy LyfenkoScore: 3,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2025 17:423,928613,083,138568,188,00021,006,00016,949,248
2Aug 31, 2025 17:403,929618,179,387565,448,00023,976,00016,998,400
3Aug 31, 2025 17:403,930615,993,464565,495,00023,978,00016,953,344
4Aug 31, 2025 17:403,930613,241,426567,519,00021,981,00016,949,248
5Aug 31, 2025 17:423,930612,039,560568,455,00020,979,00017,088,512
6Aug 31, 2025 17:423,931611,987,150565,615,00023,983,00017,100,800
7Aug 31, 2025 17:423,931611,492,050565,647,00023,985,00017,002,496
8Aug 31, 2025 17:423,932615,531,639567,736,00021,989,00016,961,536
9Aug 31, 2025 17:423,934613,173,609570,044,00020,001,00017,096,704