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 2, 2026 17:15Victor MerckléVictor MerckléScore: 1,698Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:171,62312,795,4942,910,0001,149,0002,117,632stderr
2Aug 2, 2026 17:171,65414,035,8692,977,0001,160,0002,117,632stderr
3Aug 2, 2026 17:171,69012,665,7543,084,0001,141,0002,117,632stderr
4Aug 2, 2026 17:171,69513,751,5603,082,0001,156,0002,117,632stderr
5Aug 2, 2026 17:171,69813,366,8733,088,0001,158,0002,117,632stderr
6Aug 2, 2026 17:171,70313,312,4143,093,0001,166,0002,117,632stderr
7Aug 2, 2026 17:171,71012,735,7813,124,0001,152,0002,117,632stderr
8Aug 2, 2026 17:171,71713,343,8593,121,0001,173,0002,117,632stderr
9Aug 2, 2026 17:171,72212,778,3343,147,0001,160,0002,117,632stderr