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 16, 2026 23:09M-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 16, 2026 23:1009,717,47301,243,0002,117,632pos 0: expected 80 got 248
2May 16, 2026 23:1009,784,55001,242,0002,117,632pos 0: expected 193 got 249
3May 16, 2026 23:1009,611,90401,245,0002,117,632pos 0: expected 172 got 249