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 15, 2026 00:26Victor MerckléVictor MerckléScore: 1,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 00:271,34012,231,3281,846,0001,505,0002,117,632stderr
2Sep 15, 2026 00:271,36712,035,8901,886,0001,533,0002,117,632stderr
3Sep 15, 2026 00:271,36821,014,4812,295,0001,127,0002,117,632stderr
4Sep 15, 2026 00:271,42912,389,6572,037,0001,536,0002,117,632stderr
5Sep 15, 2026 00:271,47612,355,2232,146,0001,545,0002,117,632stderr
6Sep 15, 2026 00:271,48112,452,0522,145,0001,558,0002,117,632stderr
7Sep 15, 2026 00:271,48612,693,4782,147,0001,570,0002,117,632stderr
8Sep 15, 2026 00:271,50712,310,7592,588,0001,181,0002,117,632stderr
9Sep 15, 2026 00:271,57012,597,9652,338,0001,587,0002,117,632stderr