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 14, 2026 13:29Victor MerckléVictor MerckléScore: 1,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 13:301,38512,268,6722,408,0001,056,0002,117,632stderr
2Sep 14, 2026 13:301,42412,277,8332,468,0001,093,0002,117,632stderr
3Sep 14, 2026 13:301,45112,393,9642,525,0001,103,0002,117,632stderr
4Sep 14, 2026 13:301,46612,400,0232,550,0001,115,0002,117,632stderr
5Sep 14, 2026 13:301,47213,203,3642,564,0001,116,0002,117,632stderr
6Sep 14, 2026 13:301,48412,506,3302,587,0001,124,0002,117,632stderr
7Sep 14, 2026 13:301,50912,463,6922,634,0001,139,0002,117,632stderr
8Sep 14, 2026 13:301,52212,612,9312,704,0001,102,0002,117,632stderr
9Sep 14, 2026 13:301,52412,409,4932,648,0001,163,0002,117,632stderr