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 01:48Elijah KinElijah KinScore: 2,238Success
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 01:492,02014,217,7263,816,0001,234,0002,117,632
2Jun 9, 2026 01:492,04014,215,6793,859,0001,242,0002,117,632
3Jun 9, 2026 01:492,04314,206,8763,817,0001,292,0002,117,632
4Jun 9, 2026 01:492,12814,580,2894,072,0001,249,0002,117,632
5Jun 9, 2026 01:492,23814,632,6144,348,0001,249,0002,117,632
6Jun 9, 2026 01:492,24115,032,4994,341,0001,263,0002,117,632
7Jun 9, 2026 01:492,25914,613,5104,389,0001,259,0002,117,632
8Jun 9, 2026 01:492,27014,799,8724,428,0001,248,0002,117,632
9Jun 9, 2026 01:492,30814,851,5754,505,0001,267,0002,117,632