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 18, 2026 05:16limanjun99limanjun99Score: 3,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 05:163,122495,032,248432,306,00035,942,00017,088,512
2Apr 18, 2026 05:163,129494,571,950431,471,00037,953,00017,063,936
3Apr 18, 2026 05:163,138489,404,237429,701,00040,971,00016,982,016
4Apr 18, 2026 05:163,139494,142,049432,820,00037,984,00017,096,704
5Apr 18, 2026 05:163,140498,988,765431,059,00040,005,00017,108,992
6Apr 18, 2026 05:163,143498,626,175437,494,00033,960,00016,994,304
7Apr 18, 2026 05:163,146495,340,688436,936,00034,994,00017,186,816
8Apr 18, 2026 05:163,154497,080,890437,085,00036,007,00016,994,304
9Apr 18, 2026 05:163,163499,603,555433,439,00040,947,00016,990,208