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 listMar 12, 2026 02:58olliecrowolliecrowScore: 9,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 02:589,68450,332,89120,176,0004,035,0002,330,624
2Mar 12, 2026 02:589,71248,704,57120,234,0004,046,0002,338,816
3Mar 12, 2026 02:589,72053,198,78519,238,0005,062,0002,334,720