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 20:41Elijah KinElijah KinScore: 2,780Success
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 20:432,57415,495,7835,325,0001,111,0002,117,632
2Jun 5, 2026 20:432,65515,632,4635,532,0001,107,0002,117,632
3Jun 5, 2026 20:432,72015,849,3165,689,0001,113,0002,117,632
4Jun 5, 2026 20:432,75015,946,6325,635,0001,240,0002,117,632
5Jun 5, 2026 20:432,78016,263,8735,796,0001,154,0002,117,632
6Jun 5, 2026 20:432,78316,481,5585,835,0001,124,0002,117,632
7Jun 5, 2026 20:432,78916,046,4755,851,0001,122,0002,117,632
8Jun 5, 2026 20:432,81116,508,3985,902,0001,126,0002,117,632
9Jun 5, 2026 20:432,83916,609,2645,976,0001,122,0002,117,632