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 3, 2026 17:12Elijah KinElijah KinScore: 3,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 17:132,94816,415,1996,230,0001,141,0002,117,632
2Jun 3, 2026 17:132,96216,341,4836,260,0001,145,0002,117,632
3Jun 3, 2026 17:132,97716,581,9996,293,0001,151,0002,117,632
4Jun 3, 2026 17:132,99016,674,2666,316,0001,161,0002,117,632
5Jun 3, 2026 17:133,01016,576,2556,377,0001,148,0002,117,632
6Jun 3, 2026 17:133,01016,559,7006,361,0001,166,0002,117,632
7Jun 3, 2026 17:133,08217,175,8036,529,0001,178,0002,117,632
8Jun 3, 2026 17:133,09116,876,4366,559,0001,169,0002,117,632
9Jun 3, 2026 17:133,14617,388,4426,673,0001,192,0002,117,632