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 9, 2026 05:10Elijah KinElijah KinScore: 2,237Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 05:112,04914,143,6423,924,0001,199,0002,117,632
2Jun 9, 2026 05:112,04914,251,2163,924,0001,200,0002,117,632
3Jun 9, 2026 05:112,07114,253,4063,959,0001,219,0002,117,632
4Jun 9, 2026 05:112,20814,596,6504,316,0001,205,0002,117,632
5Jun 9, 2026 05:112,23714,676,6724,380,0001,214,0002,117,632
6Jun 9, 2026 05:112,28014,812,2234,495,0001,205,0002,117,632
7Jun 9, 2026 05:112,32814,886,6804,598,0001,222,0002,117,632
8Jun 9, 2026 05:112,33514,877,9774,629,0001,209,0002,117,632
9Jun 9, 2026 05:112,34815,041,7334,564,0001,306,0002,117,632