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 00:03Elijah KinElijah KinScore: 2,718Success
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 00:062,66815,691,4165,562,0001,109,0002,117,632
2Jun 4, 2026 00:062,67116,004,1705,539,0001,139,0002,117,632
3Jun 4, 2026 00:062,67216,131,0025,547,0001,134,0002,117,632
4Jun 4, 2026 00:062,67215,788,5025,532,0001,148,0002,117,632
5Jun 4, 2026 00:062,71815,778,2175,650,0001,147,0002,117,632
6Jun 4, 2026 00:062,75416,329,9615,734,0001,153,0002,117,632
7Jun 4, 2026 00:062,75415,961,6345,741,0001,146,0002,117,632
8Jun 4, 2026 00:062,78516,033,7825,785,0001,179,0002,117,632
9Jun 4, 2026 00:062,80416,499,7595,892,0001,120,0002,117,632