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 15, 2026 07:25Elijah KinElijah KinScore: 12,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 07:2512,75459,076,42526,904,0004,982,0002,465,792
2Mar 15, 2026 07:2512,77059,072,69526,937,0004,988,0002,490,368
3Mar 15, 2026 07:2512,83956,765,41825,076,0007,021,0002,301,952