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 20:31Josu San MartinJosu San MartinScore: 2,795Success
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 20:312,75215,606,4975,774,0001,108,0002,117,632
2Sep 15, 2026 20:312,75215,600,6655,772,0001,108,0002,117,632
3Sep 15, 2026 20:312,76015,592,1485,796,0001,105,0002,117,632
4Sep 15, 2026 20:312,76615,548,7985,806,0001,110,0002,117,632
5Sep 15, 2026 20:312,79515,727,8105,876,0001,113,0002,117,632
6Sep 15, 2026 20:312,84015,748,2755,976,0001,126,0002,117,632
7Sep 15, 2026 20:312,84215,790,1175,977,0001,128,0002,117,632
8Sep 15, 2026 20:312,85115,771,4825,999,0001,129,0002,117,632
9Sep 15, 2026 20:312,85315,830,9866,005,0001,128,0002,117,632