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 4, 2026 21:48Elijah KinElijah KinScore: 2,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 21:492,52315,354,1655,191,0001,117,0002,117,632
2Jun 4, 2026 21:492,53315,300,0805,199,0001,134,0002,117,632
3Jun 4, 2026 21:492,54316,978,8965,213,0001,145,0002,117,632
4Jun 4, 2026 21:492,54815,373,9485,254,0001,118,0002,117,632
5Jun 4, 2026 21:492,55215,467,6105,254,0001,126,0002,117,632
6Jun 4, 2026 21:492,55415,563,1285,258,0001,127,0002,117,632
7Jun 4, 2026 21:492,62615,633,0905,422,0001,143,0002,117,632
8Jun 4, 2026 21:492,65017,354,7845,483,0001,143,0002,117,632
9Jun 4, 2026 21:492,68815,972,2525,549,0001,172,0002,117,632