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 01:12Elijah KinElijah KinScore: 2,691Success
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 01:152,56915,424,7335,285,0001,139,0002,117,632
2Jun 4, 2026 01:152,60015,514,6895,374,0001,127,0002,117,632
3Jun 4, 2026 01:152,66717,821,1465,505,0001,163,0002,117,632
4Jun 4, 2026 01:152,66815,811,9465,520,0001,152,0002,117,632
5Jun 4, 2026 01:152,69117,338,7295,548,0001,180,0002,117,632
6Jun 4, 2026 01:152,74416,321,3845,730,0001,132,0002,117,632
7Jun 4, 2026 01:152,74816,308,3465,709,0001,162,0002,117,632
8Jun 4, 2026 01:152,78216,428,0975,785,0001,170,0002,117,632
9Jun 4, 2026 01:152,79817,200,4135,833,0001,164,0002,117,632