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 listMay 17, 2026 06:33Jacob McDanielJacob McDanielScore: 10,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:3510,10134,341,73721,094,0004,159,0002,113,536
2May 17, 2026 06:3510,11835,831,24521,869,0003,428,0002,113,536
3May 17, 2026 06:3510,13443,455,73121,128,0004,207,0002,113,536
4May 17, 2026 06:3510,16434,244,12821,173,0004,237,0002,113,536
5May 17, 2026 06:3510,19035,736,95521,176,0004,299,0002,113,536
6May 17, 2026 06:3510,20134,583,28421,186,0004,318,0002,113,536
7May 17, 2026 06:3510,36637,697,92621,325,0004,591,0002,113,536
8May 17, 2026 06:3510,68935,559,67122,184,0004,540,0002,113,536
9May 17, 2026 06:3510,79735,988,21922,237,0004,757,0002,113,536