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 03:37Elijah KinElijah KinScore: 2,605Success
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 03:402,53715,334,2395,227,0001,117,0002,117,632
2Jun 4, 2026 03:402,54615,400,4795,245,0001,120,0002,117,632
3Jun 4, 2026 03:402,55915,418,6105,274,0001,124,0002,117,632
4Jun 4, 2026 03:402,57215,476,1125,304,0001,128,0002,117,632
5Jun 4, 2026 03:402,60515,484,2525,365,0001,148,0002,117,632
6Jun 4, 2026 03:402,62615,996,1065,438,0001,129,0002,117,632
7Jun 4, 2026 03:402,65415,695,8885,473,0001,163,0002,117,632
8Jun 4, 2026 03:402,67616,112,7225,533,0001,157,0002,117,632
9Jun 4, 2026 03:402,68416,201,2095,542,0001,168,0002,117,632