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 03:26Elijah KinElijah KinScore: 2,661Success
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 03:292,56315,537,0165,278,0001,131,0002,117,632
2Jun 4, 2026 03:292,56915,456,1385,303,0001,121,0002,117,632
3Jun 4, 2026 03:292,57615,547,7665,312,0001,130,0002,117,632
4Jun 4, 2026 03:292,62215,575,0025,415,0001,142,0002,117,632
5Jun 4, 2026 03:292,66115,723,3765,501,0001,152,0002,117,632
6Jun 4, 2026 03:292,68715,733,8895,537,0001,181,0002,117,632
7Jun 4, 2026 03:292,70616,273,7625,587,0001,180,0002,117,632
8Jun 4, 2026 03:292,72216,261,7235,613,0001,194,0002,117,632
9Jun 4, 2026 03:292,78118,194,6845,792,0001,162,0002,117,632