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 listApr 17, 2026 22:46olliecrowolliecrowScore: 4,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 22:464,76029,049,6468,926,0002,975,0002,379,776
2Apr 17, 2026 22:464,76729,045,7599,932,0001,986,0002,383,872
3Apr 17, 2026 22:464,87830,465,78610,164,0002,032,0002,310,144