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 08:34Victor MerckléVictor MerckléScore: 1,600Success
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 08:361,56012,374,1692,837,0001,064,0002,117,632stderr
2Aug 29, 2026 08:361,59012,372,1122,875,0001,101,0002,117,632stderr
3Aug 29, 2026 08:361,59612,344,2002,882,0001,108,0002,117,632stderr
4Aug 29, 2026 08:361,59812,306,6702,896,0001,099,0002,117,632stderr
5Aug 29, 2026 08:361,60012,337,7972,893,0001,109,0002,117,632stderr
6Aug 29, 2026 08:361,60312,416,1752,903,0001,106,0002,117,632stderr
7Aug 29, 2026 08:361,60412,439,8492,904,0001,106,0002,117,632stderr
8Aug 29, 2026 08:361,66512,610,2913,010,0001,153,0002,117,632stderr
9Aug 29, 2026 08:361,67812,607,8203,062,0001,135,0002,117,632stderr