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 30, 2025 05:21Josu San MartinJosu San MartinScore: 17,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 05:2117,53569,484,47340,849,0002,989,0002,330,624
2Dec 30, 2025 05:2417,54071,379,43241,857,0001,993,0002,347,008
3Dec 30, 2025 05:2117,55071,720,08637,892,0005,983,0002,498,560
4Dec 30, 2025 05:2417,55466,930,26740,893,0002,992,0002,322,432
5Dec 30, 2025 05:2417,55569,740,46240,896,0002,992,0002,322,432
6Dec 30, 2025 05:2117,55674,413,82841,896,0001,995,0002,322,432
7Dec 30, 2025 05:2417,58574,594,96939,967,0003,996,0002,330,624
8Dec 30, 2025 05:2117,61274,458,20841,027,0003,002,0002,334,720
9Dec 30, 2025 05:2417,61568,264,73341,035,0003,002,0002,510,848
10Dec 30, 2025 05:2117,64074,993,96342,096,0002,004,0002,322,432
11Dec 30, 2025 05:2417,64071,059,95139,089,0005,011,0002,334,720
12Dec 30, 2025 05:2417,64271,191,99344,105,00002,330,624
13Dec 30, 2025 05:2117,64871,079,16042,114,0002,005,0002,334,720
14Dec 30, 2025 05:2117,66171,762,65039,135,0005,017,0002,469,888
15Dec 30, 2025 05:2117,67576,334,50340,171,0004,017,0002,473,984
16Dec 30, 2025 05:2417,68169,879,93241,189,0003,013,0002,494,464
17Dec 30, 2025 05:2417,76271,787,20541,377,0003,027,0002,326,528
18Dec 30, 2025 05:2117,83465,318,23639,520,0005,066,0002,498,560