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 01:34olliecrowolliecrowScore: 5,794Success
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 01:345,71942,890,98613,277,0001,021,0002,420,736
2Apr 17, 2026 01:345,79432,930,37812,415,0002,069,0002,379,776
3Apr 17, 2026 01:345,82331,241,84714,557,00002,375,680