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 listMay 20, 2026 16:22M-RochatM-RochatError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:23011,307,04802,077,0002,121,728pos 0: expected 237 got 113
2May 20, 2026 16:23011,264,05302,078,0002,121,728pos 0: expected 194 got 113
3May 20, 2026 16:23013,239,72202,104,0002,121,728pos 0: expected 242 got 113