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 19:20Victor MerckléVictor MerckléScore: 1,503Success
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 19:211,44212,421,6552,534,0001,071,0002,117,632stderr
2Sep 14, 2026 19:211,47412,302,5642,597,0001,088,0002,117,632stderr
3Sep 14, 2026 19:211,47612,382,8722,597,0001,093,0002,117,632stderr
4Sep 14, 2026 19:211,48812,414,4552,622,0001,099,0002,117,632stderr
5Sep 14, 2026 19:211,50312,430,0192,646,0001,113,0002,117,632stderr
6Sep 14, 2026 19:211,51912,573,5762,673,0001,125,0002,117,632stderr
7Sep 14, 2026 19:211,53412,474,1782,698,0001,139,0002,117,632stderr
8Sep 14, 2026 19:211,53912,621,9752,712,0001,136,0002,117,632stderr
9Sep 14, 2026 19:211,56412,423,6012,746,0001,165,0002,117,632stderr