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 15, 2026 22:22marko1597marko1597Error
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 22:3909,719,385973,00002,117,632pos 0: expected 238 got 0
2Aug 15, 2026 22:3908,946,7901,005,00002,117,632pos 0: expected 140 got 0
3Aug 15, 2026 22:3909,787,131975,00002,117,632pos 0: expected 119 got 0