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 20, 2026 17:04A_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 20, 2026 17:04042,658,92130,211,0003,150,0002,113,536pos 0: expected 206 got 25
2Jun 20, 2026 17:04044,087,86131,607,0003,185,0002,113,536pos 0: expected 108 got 184
3Jun 20, 2026 17:04042,771,84530,399,0003,155,0002,113,536pos 0: expected 96 got 172