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 6, 2026 15:15olliecrowolliecrowScore: 28,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 15:1528,22398,913,55166,527,0004,031,0002,330,624
2Apr 6, 2026 15:1528,38195,911,92762,959,0007,994,0002,392,064
3Apr 6, 2026 15:1528,67898,304,61668,666,0003,029,0002,334,720