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 listJun 4, 2026 01:25Elijah KinElijah KinScore: 2,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 01:282,59617,294,1405,363,0001,128,0002,117,632
2Jun 4, 2026 01:282,68116,212,2065,552,0001,151,0002,117,632
3Jun 4, 2026 01:282,70416,151,3625,610,0001,152,0002,117,632
4Jun 4, 2026 01:282,71117,783,6475,605,0001,174,0002,117,632
5Jun 4, 2026 01:282,71816,312,4205,632,0001,164,0002,117,632
6Jun 4, 2026 01:282,76116,374,9635,698,0001,205,0002,117,632
7Jun 4, 2026 01:282,77416,389,6825,760,0001,175,0002,117,632
8Jun 4, 2026 01:282,77916,126,7255,779,0001,169,0002,117,632
9Jun 4, 2026 01:282,78216,311,9305,846,0001,111,0002,117,632