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:28M-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:2809,777,59401,219,0002,117,632pos 0: expected 153 got 250
2May 16, 2026 19:2809,742,99301,214,0002,117,632pos 0: expected 64 got 250
3May 16, 2026 19:2809,602,53801,239,0002,117,632pos 0: expected 4 got 250