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 listSep 10, 2026 08:22Victor MerckléVictor MerckléScore: 3,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 08:222,98615,915,2806,257,0001,210,0002,117,632stderr
2Sep 10, 2026 08:223,00815,892,2086,325,0001,196,0002,117,632stderr
3Sep 10, 2026 08:223,01315,904,0346,331,0001,202,0002,117,632stderr
4Sep 10, 2026 08:223,02015,750,1156,338,0001,213,0002,117,632stderr
5Sep 10, 2026 08:223,02015,924,3906,349,0001,202,0002,117,632stderr
6Sep 10, 2026 08:223,02015,894,1616,341,0001,211,0002,117,632stderr
7Sep 10, 2026 08:223,02615,926,9216,355,0001,211,0002,117,632stderr
8Sep 10, 2026 08:223,02915,704,9486,366,0001,207,0002,117,632stderr
9Sep 10, 2026 08:223,05116,120,3926,532,0001,097,0002,117,632stderr