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 19:26M-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 19:2709,505,62501,160,0002,117,632pos 0: expected 141 got 97
2May 16, 2026 19:2709,689,84101,159,0002,117,632pos 0: expected 174 got 97
3May 16, 2026 19:2709,492,02501,156,0002,117,632pos 0: expected 72 got 97