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 listSep 15, 2026 10:36Victor MerckléVictor MerckléScore: 1,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 10:371,35812,274,0381,867,0001,529,0002,121,728stderr
2Sep 15, 2026 10:371,38312,290,1211,906,0001,553,0002,121,728stderr
3Sep 15, 2026 10:371,38512,221,6151,905,0001,558,0002,121,728stderr
4Sep 15, 2026 10:371,39312,122,9051,908,0001,576,0002,121,728stderr
5Sep 15, 2026 10:371,40612,247,3631,923,0001,594,0002,121,728stderr
6Sep 15, 2026 10:371,41012,248,6691,887,0001,638,0002,121,728stderr
7Sep 15, 2026 10:371,44612,382,2202,078,0001,538,0002,121,728stderr
8Sep 15, 2026 10:371,47012,470,2912,133,0001,543,0002,121,728stderr
9Sep 15, 2026 10:371,48312,445,4892,122,0001,587,0002,121,728stderr