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 21:07Yuriy LyfenkoYuriy LyfenkoScore: 3,964Success
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 21:073,96132,197,1787,922,0001,980,0002,510,848
2Mar 21, 2026 21:073,96431,685,6527,929,0001,982,0002,457,600
3Mar 21, 2026 21:074,05133,962,8848,102,0002,025,0002,502,656