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 13:25Victor MerckléVictor MerckléScore: 1,589Success
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 13:271,57412,321,7422,845,0001,092,0002,117,632stderr
2Aug 29, 2026 13:271,57712,257,9462,848,0001,095,0002,117,632stderr
3Aug 29, 2026 13:271,58212,280,3342,841,0001,115,0002,117,632stderr
4Aug 29, 2026 13:271,58312,321,3872,859,0001,100,0002,117,632stderr
5Aug 29, 2026 13:271,58912,326,4942,860,0001,114,0002,117,632stderr
6Aug 29, 2026 13:271,60212,416,8992,879,0001,126,0002,117,632stderr
7Aug 29, 2026 13:271,64812,511,5072,981,0001,139,0002,117,632stderr
8Aug 29, 2026 13:271,65712,326,3993,015,0001,128,0002,117,632stderr
9Aug 29, 2026 13:271,70412,656,0723,102,0001,159,0002,117,632stderr