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:17A_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:17068,936,42551,628,0007,627,0002,113,536pos 0: expected 44 got 43
2Jun 21, 2026 17:17069,372,60851,103,0007,500,0002,113,536pos 0: expected 207 got 206
3Jun 21, 2026 17:17067,637,53950,881,0007,563,0002,113,536pos 0: expected 232 got 231