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 29, 2026 14:53Victor 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 29, 2026 14:541,55212,316,8162,424,0001,458,0002,117,632stderr
2Aug 29, 2026 14:541,58212,373,3942,464,0001,492,0002,117,632stderr
3Aug 29, 2026 14:541,58812,128,7822,478,0001,492,0002,117,632stderr
4Aug 29, 2026 14:541,58812,359,0452,487,0001,484,0002,117,632stderr
5Aug 29, 2026 14:541,59712,400,2842,506,0001,488,0002,117,632stderr
6Aug 29, 2026 14:541,59812,147,3352,870,0001,125,0002,117,632stderr
7Aug 29, 2026 14:541,61219,599,9502,894,0001,136,0002,117,632stderr
8Aug 29, 2026 14:541,63212,472,3582,542,0001,540,0002,117,632stderr
9Aug 29, 2026 14:541,63412,304,5822,537,0001,549,0002,117,632stderr