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 30, 2026 22:58Victor MerckléVictor MerckléScore: 1,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 23:061,47012,083,7362,603,0001,074,0002,117,632stderr
2Aug 30, 2026 23:061,47512,071,2802,606,0001,082,0002,117,632stderr
3Aug 30, 2026 23:061,51312,084,0062,653,0001,130,0002,117,632stderr
4Aug 30, 2026 23:061,57512,440,7912,617,0001,321,0002,117,632stderr
5Aug 30, 2026 23:061,58412,331,3212,857,0001,104,0002,117,632stderr
6Aug 30, 2026 23:061,59412,391,2442,859,0001,128,0002,117,632stderr
7Aug 30, 2026 23:061,60812,971,3052,876,0001,146,0002,117,632stderr
8Aug 30, 2026 23:061,64412,922,9422,706,0001,405,0002,117,632stderr
9Aug 30, 2026 23:061,67420,440,2342,766,0001,419,0002,117,632stderr