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 listAug 31, 2026 00:56Victor MerckléVictor MerckléScore: 1,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 01:061,49011,923,8152,653,0001,074,0002,117,632stderr
2Aug 31, 2026 01:061,51412,028,6242,677,0001,110,0002,117,632stderr
3Aug 31, 2026 01:061,55612,296,2512,657,0001,235,0002,117,632stderr
4Aug 31, 2026 01:061,58512,293,1972,836,0001,127,0002,117,632stderr
5Aug 31, 2026 01:061,59712,361,2542,863,0001,130,0002,117,632stderr
6Aug 31, 2026 01:061,60412,251,7162,852,0001,158,0002,117,632stderr
7Aug 31, 2026 01:061,60712,407,8962,868,0001,151,0002,117,632stderr
8Aug 31, 2026 01:061,61012,990,9682,831,0001,196,0002,117,632stderr
9Aug 31, 2026 01:061,61412,284,5552,883,0001,152,0002,117,632stderr