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 13:20Victor MerckléVictor MerckléError
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 13:22011,405,55201,644,0002,129,920pos 0: expected 7 got 48stderr
2Aug 31, 2026 13:22011,348,73201,627,0002,129,920pos 0: expected 101 got 48stderr
3Aug 31, 2026 13:22011,388,32801,626,0002,129,920pos 0: expected 249 got 48stderr