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 3, 2026 16:40Elijah KinElijah KinScore: 2,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 16:432,83716,149,9535,980,0001,113,0002,117,632
2Jun 3, 2026 16:432,84716,128,1715,992,0001,127,0002,117,632
3Jun 3, 2026 16:432,87016,256,6886,051,0001,125,0002,117,632
4Jun 3, 2026 16:432,88116,229,2616,025,0001,178,0002,117,632
5Jun 3, 2026 16:432,88716,317,2146,053,0001,165,0002,117,632
6Jun 3, 2026 16:432,97616,873,4246,273,0001,169,0002,117,632
7Jun 3, 2026 16:433,00016,558,9246,329,0001,171,0002,117,632
8Jun 3, 2026 16:433,00119,042,8906,314,0001,189,0002,117,632
9Jun 3, 2026 16:433,00218,418,0686,326,0001,179,0002,117,632