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 7, 2026 15:25Elijah KinElijah KinScore: 2,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 15:262,27214,759,1634,568,0001,112,0002,117,632
2Jun 7, 2026 15:262,38015,018,3274,844,0001,107,0002,117,632
3Jun 7, 2026 15:262,40315,092,7624,904,0001,104,0002,117,632
4Jun 7, 2026 15:262,46815,149,7955,072,0001,098,0002,117,632
5Jun 7, 2026 15:262,48915,331,8105,020,0001,203,0002,117,632
6Jun 7, 2026 15:262,51215,291,8395,179,0001,102,0002,117,632
7Jun 7, 2026 15:262,51415,354,9185,180,0001,105,0002,117,632
8Jun 7, 2026 15:262,55215,523,4975,276,0001,106,0002,117,632
9Jun 7, 2026 15:262,55615,442,1015,289,0001,101,0002,117,632