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 listAug 29, 2026 09:08Victor MerckléVictor MerckléScore: 1,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 09:101,60012,415,9232,907,0001,094,0002,117,632stderr
2Aug 29, 2026 09:101,60212,356,8752,912,0001,095,0002,117,632stderr
3Aug 29, 2026 09:101,60312,384,6122,909,0001,100,0002,117,632stderr
4Aug 29, 2026 09:101,60412,392,6812,904,0001,107,0002,117,632stderr
5Aug 29, 2026 09:101,62912,566,6042,955,0001,119,0002,117,632stderr
6Aug 29, 2026 09:101,63012,500,9222,937,0001,138,0002,117,632stderr
7Aug 29, 2026 09:101,63512,449,8832,856,0001,232,0002,117,632stderr
8Aug 29, 2026 09:101,70312,587,6983,124,0001,135,0002,117,632stderr
9Aug 29, 2026 09:101,70912,641,0503,136,0001,137,0002,117,632stderr