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 16:03Elijah KinElijah KinScore: 2,420Success
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 16:042,15616,378,0174,123,0001,268,0002,117,632
2Jun 7, 2026 16:042,17514,535,3664,169,0001,270,0002,117,632
3Jun 7, 2026 16:042,29514,715,7984,463,0001,275,0002,117,632
4Jun 7, 2026 16:042,40015,057,5514,708,0001,293,0002,117,632
5Jun 7, 2026 16:042,42015,461,9094,744,0001,307,0002,117,632
6Jun 7, 2026 16:042,42715,161,8714,796,0001,272,0002,117,632
7Jun 7, 2026 16:042,44515,209,4914,826,0001,287,0002,117,632
8Jun 7, 2026 16:042,44815,246,6484,843,0001,279,0002,117,632
9Jun 7, 2026 16:042,45015,557,2314,833,0001,294,0002,117,632