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 21:37Josu San MartinJosu San MartinScore: 2,813Success
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 21:382,74615,896,5345,759,0001,106,0002,117,632
2Sep 15, 2026 21:382,75315,531,9645,776,0001,107,0002,117,632
3Sep 15, 2026 21:382,76415,648,2975,799,0001,111,0002,117,632
4Sep 15, 2026 21:382,78515,654,4985,843,0001,121,0002,117,632
5Sep 15, 2026 21:382,81315,470,1565,901,0001,133,0002,117,632
6Sep 15, 2026 21:382,83915,702,6715,972,0001,126,0002,117,632
7Sep 15, 2026 21:382,84215,664,9685,978,0001,127,0002,117,632
8Sep 15, 2026 21:382,84815,923,8305,993,0001,129,0002,117,632
9Sep 15, 2026 21:383,01316,380,9306,435,0001,098,0002,117,632