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 17:37Victor MerckléVictor MerckléScore: 1,448Success
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 17:381,39612,264,1352,427,0001,064,0002,117,632stderr
2Sep 14, 2026 17:381,40412,277,2492,444,0001,067,0002,117,632stderr
3Sep 14, 2026 17:381,42912,366,4562,483,0001,090,0002,117,632stderr
4Sep 14, 2026 17:381,43012,447,0182,498,0001,078,0002,117,632stderr
5Sep 14, 2026 17:381,44812,149,2142,498,0001,122,0002,117,632stderr
6Sep 14, 2026 17:381,44812,326,7242,513,0001,108,0002,117,632stderr
7Sep 14, 2026 17:381,51312,507,4572,658,0001,125,0002,117,632stderr
8Sep 14, 2026 17:381,52312,470,8652,656,0001,152,0002,117,632stderr
9Sep 14, 2026 17:381,54512,476,3452,659,0001,204,0002,117,632stderr