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 21, 2026 20:42Yuriy LyfenkoYuriy LyfenkoScore: 4,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 20:424,03328,571,0128,066,0002,016,0002,371,584
2Mar 21, 2026 20:424,04024,509,9398,080,0002,020,0002,473,984
3Mar 21, 2026 20:424,16728,276,5166,251,0004,167,0002,383,872