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 10, 2026 16:11Andrew EpsteinAndrew EpsteinScore: 1,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 16:121,44812,076,9122,573,0001,048,0002,117,632
2Sep 10, 2026 16:121,45114,519,0832,578,0001,051,0002,117,632
3Sep 10, 2026 16:121,55612,493,8492,835,0001,056,0002,117,632
4Sep 10, 2026 16:121,55812,410,3032,842,0001,055,0002,117,632
5Sep 10, 2026 16:121,57012,491,3902,869,0001,058,0002,117,632
6Sep 10, 2026 16:121,58012,319,7392,886,0001,065,0002,117,632
7Sep 10, 2026 16:121,60512,544,1902,949,0001,065,0002,117,632
8Sep 10, 2026 16:121,60514,149,4972,952,0001,061,0002,117,632
9Sep 10, 2026 16:121,61612,467,6092,954,0001,088,0002,117,632