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 19:34Victor 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 19:34038,265,69327,094,0002,095,0002,117,632pos 0: expected 92 got 169
2Jun 13, 2026 19:34037,862,11226,362,0002,088,0002,117,632pos 0: expected 184 got 6
3Jun 13, 2026 19:34037,523,18426,335,0002,089,0002,117,632pos 0: expected 171 got 247