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 6, 2026 21:59Elijah KinElijah KinScore: 2,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 22:002,39715,019,4914,766,0001,227,0002,117,632
2Jun 6, 2026 22:002,46115,235,8265,037,0001,116,0002,117,632
3Jun 6, 2026 22:002,46415,255,4555,042,0001,119,0002,117,632
4Jun 6, 2026 22:002,50217,920,7715,137,0001,119,0002,117,632
5Jun 6, 2026 22:002,52015,340,4415,058,0001,244,0002,117,632
6Jun 6, 2026 22:002,54715,410,6995,259,0001,110,0002,117,632
7Jun 6, 2026 22:002,56215,476,6035,296,0001,109,0002,117,632
8Jun 6, 2026 22:002,56415,482,0335,300,0001,112,0002,117,632
9Jun 6, 2026 22:002,59115,502,1755,292,0001,187,0002,117,632