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 listDec 23, 2025 04:55Josu San MartinJosu San MartinScore: 51,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 04:5551,431157,837,573120,542,0008,036,0002,482,176
2Dec 23, 2025 04:5551,433150,255,541117,532,00011,050,0002,338,816
3Dec 23, 2025 04:5551,434152,628,398120,550,0008,036,0002,482,176
4Dec 23, 2025 04:5551,452155,090,665120,591,0008,039,0002,482,176
5Dec 23, 2025 04:5651,471156,184,524119,630,0009,047,0002,469,888
6Dec 23, 2025 04:5551,471153,375,715123,651,0005,026,0002,482,176
7Dec 23, 2025 04:5551,509158,346,520118,791,0009,982,0002,293,760
8Dec 23, 2025 04:5551,523156,873,974117,825,00010,983,0002,465,792
9Dec 23, 2025 04:5551,524157,102,200120,821,0007,988,0002,482,176
10Dec 23, 2025 04:5551,525155,930,146120,825,0007,988,0002,482,176
11Dec 23, 2025 04:5651,529155,252,254118,836,0009,986,0002,478,080
12Dec 23, 2025 04:5551,537153,310,423120,853,0007,990,0002,478,080
13Dec 23, 2025 04:5651,541155,758,231119,864,0008,989,0002,478,080
14Dec 23, 2025 04:5551,544155,233,748117,872,00010,988,0002,326,528
15Dec 23, 2025 04:5551,556154,309,717118,899,0009,991,0002,482,176
16Dec 23, 2025 04:5551,611155,649,559120,026,0009,001,0002,482,176
17Dec 23, 2025 04:5551,623156,943,749118,053,00011,005,0002,478,080
18Dec 23, 2025 04:5551,630155,543,447119,070,00010,005,0002,482,176
19Dec 23, 2025 04:5551,630154,019,664120,071,0009,005,0002,514,944
20Dec 23, 2025 04:5552,158156,708,181122,371,0008,024,0002,482,176
21Dec 23, 2025 04:5553,515159,688,181125,801,0007,987,0002,482,176