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 00:37Elijah KinElijah KinScore: 2,720Success
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 00:402,66215,702,4895,526,0001,130,0002,117,632
2Jun 4, 2026 00:402,69215,766,5705,570,0001,160,0002,117,632
3Jun 4, 2026 00:402,70815,803,5195,626,0001,146,0002,117,632
4Jun 4, 2026 00:402,71716,277,3225,645,0001,148,0002,117,632
5Jun 4, 2026 00:402,72015,860,2975,667,0001,135,0002,117,632
6Jun 4, 2026 00:402,74415,854,2975,716,0001,146,0002,117,632
7Jun 4, 2026 00:402,79918,278,8645,818,0001,180,0002,117,632
8Jun 4, 2026 00:402,81416,574,8485,880,0001,157,0002,117,632
9Jun 4, 2026 00:402,82616,365,1345,902,0001,164,0002,117,632