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 11:49Victor MerckléVictor MerckléScore: 1,648Success
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 11:511,63512,440,0002,970,0001,118,0002,117,632stderr
2Aug 29, 2026 11:511,63612,548,3852,969,0001,123,0002,117,632stderr
3Aug 29, 2026 11:511,64112,414,5992,978,0001,125,0002,117,632stderr
4Aug 29, 2026 11:511,64312,458,6832,974,0001,135,0002,117,632stderr
5Aug 29, 2026 11:511,64812,460,2142,988,0001,132,0002,117,632stderr
6Aug 29, 2026 11:511,65212,530,4612,980,0001,152,0002,117,632stderr
7Aug 29, 2026 11:511,74213,585,4593,208,0001,147,0002,117,632stderr
8Aug 29, 2026 11:511,75113,492,7343,207,0001,171,0002,117,632stderr
9Aug 29, 2026 11:511,76412,811,0833,234,0001,177,0002,117,632stderr