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:35limanjun99limanjun99Score: 3,104Success
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:363,083487,225,502426,525,00035,959,00017,190,912
2Apr 18, 2026 05:363,085486,891,648425,729,00036,976,00017,080,320
3Apr 18, 2026 05:363,085482,729,857426,730,00035,977,00016,990,208
4Apr 18, 2026 05:363,085486,744,241427,800,00034,983,00016,998,400
5Apr 18, 2026 05:363,089489,754,793422,469,00040,948,00016,982,016
6Apr 18, 2026 05:293,092486,089,745431,776,00031,983,00016,994,304
7Apr 18, 2026 05:363,094485,716,793428,087,00036,007,00017,158,144
8Apr 18, 2026 05:363,096491,008,494434,370,00029,956,00016,990,208
9Apr 18, 2026 05:363,097496,951,184431,615,00032,970,00017,014,784
10Apr 18, 2026 05:293,102495,019,546435,212,00030,014,00016,998,400
11Apr 18, 2026 05:293,104486,500,990424,579,00040,959,00017,022,976
12Apr 18, 2026 05:293,105491,182,732429,722,00035,976,00016,990,208
13Apr 18, 2026 05:293,109492,184,690426,366,00039,940,00016,945,152
14Apr 18, 2026 05:293,111493,493,190430,655,00035,971,00017,022,976
15Apr 18, 2026 05:293,114500,612,946428,082,00039,007,00016,998,400
16Apr 18, 2026 05:363,115497,053,383434,271,00033,020,00017,092,608
17Apr 18, 2026 05:293,116495,892,140428,446,00038,949,00017,092,608
18Apr 18, 2026 05:293,118491,214,961434,737,00032,980,00017,178,624
19Apr 18, 2026 05:353,423537,493,528480,500,00032,965,00016,990,208
20Apr 18, 2026 05:353,426542,473,001470,924,00042,993,00017,104,896
21Apr 18, 2026 05:353,434534,240,617479,101,00036,007,00017,100,800