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 07:43A_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 07:43010,970,58901,590,0002,121,728pos 0: expected 238 got 48
2Jun 20, 2026 07:43010,496,5761,445,00002,121,728pos 0: expected 197 got 48
3Jun 20, 2026 07:43010,960,62001,578,0002,121,728pos 0: expected 213 got 48