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 listMay 21, 2026 05:08Jacob McDanielJacob McDanielScore: 2,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 05:092,52317,887,1815,112,0001,197,0002,117,632
2May 21, 2026 05:092,53017,242,0855,116,0001,211,0002,117,632
3May 21, 2026 05:092,62616,399,0625,306,0001,260,0002,117,632
4May 21, 2026 05:092,62616,624,8025,298,0001,267,0002,117,632
5May 21, 2026 05:092,65417,740,1125,353,0001,284,0002,117,632
6May 21, 2026 05:092,65818,086,4255,383,0001,262,0002,117,632
7May 21, 2026 05:092,66716,904,7155,383,0001,285,0002,117,632
8May 21, 2026 05:092,67118,481,9775,532,0001,147,0002,117,632
9May 21, 2026 05:092,72318,257,6015,509,0001,299,0002,117,632