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 listJun 13, 2026 22:09Victor MerckléVictor MerckléScore: 8,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 22:108,16729,584,38917,279,0003,139,0002,117,632
2Jun 13, 2026 22:108,60030,718,68818,375,0003,127,0002,117,632
3Jun 13, 2026 22:108,75030,976,34318,787,0003,090,0002,117,632
4Jun 13, 2026 22:108,83831,258,76718,909,0003,187,0002,117,632
5Jun 13, 2026 22:108,91631,467,47219,143,0003,149,0002,117,632
6Jun 13, 2026 22:108,92431,833,71019,133,0003,177,0002,117,632
7Jun 13, 2026 22:108,97131,588,04219,327,0003,101,0002,117,632
8Jun 13, 2026 22:108,99231,676,08719,249,0003,233,0002,117,632
9Jun 13, 2026 22:109,01431,809,48619,438,0003,097,0002,117,632