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 9, 2026 14:22Victor MerckléVictor MerckléScore: 1,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 14:231,52712,644,0082,706,0001,113,0002,117,632stderr
2Sep 9, 2026 14:231,52812,424,7942,701,0001,121,0002,117,632stderr
3Sep 9, 2026 14:231,54112,301,5722,744,0001,110,0002,117,632stderr
4Sep 9, 2026 14:231,54412,457,8932,735,0001,125,0002,117,632stderr
5Sep 9, 2026 14:231,54613,115,2792,755,0001,111,0002,117,632stderr
6Sep 9, 2026 14:231,54912,192,2512,744,0001,130,0002,117,632stderr
7Sep 9, 2026 14:231,55412,603,6282,757,0001,130,0002,117,632stderr
8Sep 9, 2026 14:231,55612,359,8832,786,0001,104,0002,117,632stderr
9Sep 9, 2026 14:231,56212,439,8242,771,0001,134,0002,117,632stderr