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 listSep 15, 2026 01:18Victor MerckléVictor MerckléScore: 1,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 01:191,36012,156,6711,874,0001,527,0002,117,632stderr
2Sep 15, 2026 01:191,37812,015,6011,865,0001,582,0002,117,632stderr
3Sep 15, 2026 01:191,42912,392,1832,049,0001,525,0002,117,632stderr
4Sep 15, 2026 01:191,45312,368,1492,503,0001,131,0002,117,632stderr
5Sep 15, 2026 01:191,45412,409,7372,085,0001,551,0002,117,632stderr
6Sep 15, 2026 01:191,48412,469,3782,568,0001,142,0002,117,632stderr
7Sep 15, 2026 01:191,49612,499,8492,136,0001,604,0002,117,632stderr
8Sep 15, 2026 01:191,49812,498,9252,151,0001,596,0002,117,632stderr
9Sep 15, 2026 01:191,53712,745,9722,712,0001,131,0002,117,632stderr