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 5, 2026 19:17Elijah KinElijah KinScore: 2,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 19:192,53115,333,5155,227,0001,102,0002,117,632
2Jun 5, 2026 19:192,56915,497,0645,297,0001,127,0002,117,632
3Jun 5, 2026 19:192,63415,806,9535,412,0001,175,0002,117,632
4Jun 5, 2026 19:192,64818,233,3915,475,0001,145,0002,117,632
5Jun 5, 2026 19:192,67115,699,0985,510,0001,168,0002,117,632
6Jun 5, 2026 19:192,68415,745,9985,554,0001,157,0002,117,632
7Jun 5, 2026 19:192,71116,099,1405,620,0001,158,0002,117,632
8Jun 5, 2026 19:192,72715,954,0895,663,0001,155,0002,117,632
9Jun 5, 2026 19:192,75616,374,7035,715,0001,175,0002,117,632