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 21, 2026 17:23A_ShamanA_ShamanError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:23066,390,44650,605,0006,281,0002,113,536pos 0: expected 190 got 189
2Jun 21, 2026 17:23065,599,49350,303,0006,092,0002,113,536pos 0: expected 254 got 253
3Jun 21, 2026 17:23062,618,22047,229,0006,219,0002,113,536pos 0: expected 145 got 144