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 listJul 30, 2026 21:53Andrew TsibinAndrew TsibinScore: 1,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 21:531,89014,806,3403,464,0001,261,0002,117,632
2Jul 30, 2026 21:531,89514,744,0463,470,0001,269,0002,117,632
3Jul 30, 2026 21:531,90114,717,8863,471,0001,283,0002,117,632
4Jul 30, 2026 21:531,90514,789,4443,482,0001,281,0002,117,632
5Jul 30, 2026 21:531,90614,754,5663,462,0001,303,0002,117,632
6Jul 30, 2026 21:531,91114,809,2823,492,0001,287,0002,117,632
7Jul 30, 2026 21:531,94615,038,9553,561,0001,305,0002,117,632
8Jul 30, 2026 21:531,95414,839,3193,566,0001,319,0002,117,632
9Jul 30, 2026 21:531,99615,188,2213,644,0001,348,0002,117,632