Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listFeb 6, 2026 01:42Josu San MartinJosu San MartinScore: 5,237Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 01:085,18428,285,5588,972,0003,987,0002,396,160
2Feb 6, 2026 01:425,19028,763,0608,983,0003,992,0002,404,352
3Feb 6, 2026 01:095,19030,625,8638,982,0003,992,0002,527,232
4Feb 6, 2026 01:095,20330,166,2639,006,0004,002,0002,523,136
5Feb 6, 2026 01:085,20429,177,17311,010,0002,001,0002,527,232
6Feb 6, 2026 01:085,21326,418,80712,031,0001,002,0002,527,232
7Feb 6, 2026 01:095,21825,549,54210,034,0003,010,0002,400,256
8Feb 6, 2026 01:095,22234,914,63411,046,0002,008,0002,527,232
9Feb 6, 2026 01:085,22633,409,06211,056,0002,010,0002,379,776
10Feb 6, 2026 01:095,23031,171,77410,059,0003,017,0002,527,232
11Feb 6, 2026 01:085,23734,148,62910,071,0003,021,0002,392,064
12Feb 6, 2026 01:085,23839,698,4229,066,0004,029,0002,404,352
13Feb 6, 2026 01:085,24035,581,87510,076,0003,023,0002,404,352
14Feb 6, 2026 01:095,24132,057,23910,079,0003,023,0002,539,520
15Feb 6, 2026 01:095,26032,858,93211,126,0002,023,0002,527,232
16Feb 6, 2026 01:085,26232,612,6519,108,0004,048,0002,494,464
17Feb 6, 2026 01:085,27129,464,19911,150,0002,027,0002,404,352
18Feb 6, 2026 01:425,30427,412,9499,181,0004,080,0002,404,352
19Feb 6, 2026 01:095,30629,344,9319,183,0004,081,0002,396,160
20Feb 6, 2026 01:425,30640,259,26012,246,0001,020,0002,396,160
21Feb 6, 2026 01:095,30726,846,68010,206,0003,061,0002,396,160