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 10, 2026 17:22Victor MerckléVictor MerckléScore: 1,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 17:231,54012,456,2652,735,0001,117,0002,117,632stderr
2Sep 10, 2026 17:231,55012,804,4692,758,0001,118,0002,117,632stderr
3Sep 10, 2026 17:231,56012,474,6062,784,0001,118,0002,117,632stderr
4Sep 10, 2026 17:231,57213,062,5712,798,0001,134,0002,117,632stderr
5Sep 10, 2026 17:231,57613,104,6422,802,0001,140,0002,117,632stderr
6Sep 10, 2026 17:231,58812,577,7762,825,0001,147,0002,117,632stderr
7Sep 10, 2026 17:231,59112,463,5782,818,0001,161,0002,117,632stderr
8Sep 10, 2026 17:231,59713,333,2182,838,0001,156,0002,117,632stderr
9Sep 10, 2026 17:231,61812,472,0402,772,0001,274,0002,117,632stderr