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 29, 2026 04:19olliecrowolliecrowScore: 3,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 04:203,181494,397,962471,249,0005,990,00017,149,952
2Apr 29, 2026 04:203,181498,558,464472,281,0005,002,00016,994,304
3Apr 29, 2026 04:203,185498,706,907471,838,0005,997,00016,994,304
4Apr 29, 2026 04:203,186492,394,342471,928,0005,999,00017,244,160
5Apr 29, 2026 04:203,186495,732,288472,912,0004,999,00016,990,208
6Apr 29, 2026 04:203,187496,021,510473,180,0005,001,00016,998,400
7Apr 29, 2026 04:203,187495,617,387472,194,0006,002,00016,994,304
8Apr 29, 2026 04:203,188494,767,061472,282,0006,003,00017,248,256
9Apr 29, 2026 04:203,189493,768,560472,378,0005,992,00016,998,400