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:10Victor 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:10033,723,39822,445,0002,127,0002,117,632pos 0: expected 100 got 234
2Jun 13, 2026 20:10034,112,24122,812,0002,136,0002,117,632pos 0: expected 208 got 87
3Jun 13, 2026 20:10034,097,53722,630,0002,133,0002,117,632pos 0: expected 94 got 229