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:29Yuriy LyfenkoYuriy LyfenkoScore: 3,794Success
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:293,77433,179,7528,387,0001,048,0002,473,984
2Mar 21, 2026 20:293,77623,995,4247,342,0002,097,0002,478,080
3Mar 21, 2026 20:293,78025,461,2786,301,0003,150,0002,482,176
4Mar 21, 2026 20:293,79435,951,0339,485,00002,310,144
5Mar 21, 2026 20:293,96426,652,8698,919,000991,0002,490,368
6Mar 21, 2026 20:293,96629,583,1847,933,0001,983,0002,486,272