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:52olliecrowolliecrowScore: 3,412Success
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:523,410540,689,562508,564,0002,997,00017,072,128
2Mar 10, 2026 05:523,411536,863,614508,592,0002,997,00017,174,528
3Mar 10, 2026 05:523,411537,784,289508,671,0002,998,00017,125,376
4Mar 10, 2026 05:523,412533,950,783506,768,0004,997,00017,100,800
5Mar 10, 2026 05:523,412534,438,364507,825,0003,998,00016,941,056
6Mar 10, 2026 05:523,412534,837,345506,872,0004,998,00016,986,112
7Mar 10, 2026 05:523,413535,603,150507,913,0003,999,00017,203,200
8Mar 10, 2026 05:523,420537,397,571505,032,0007,984,00017,133,568
9Mar 10, 2026 05:523,510558,869,110524,552,0001,998,00017,158,144