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 listJun 13, 2026 20:15Victor 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
1Jun 13, 2026 20:15044,202,30331,953,0003,057,0002,117,632pos 0: expected 30 got 236
2Jun 13, 2026 20:15044,323,24232,042,0003,102,0002,117,632pos 0: expected 82 got 32
3Jun 13, 2026 20:15044,204,79132,043,0003,043,0002,117,632pos 0: expected 208 got 158