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 03:31olliecrowolliecrowScore: 8,661Success
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 03:318,59843,682,65318,424,0003,070,0002,433,024
2Mar 12, 2026 03:318,66153,757,35020,621,0001,031,0002,437,120
3Mar 12, 2026 03:318,75946,557,04719,907,0001,990,0002,506,752