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 listAug 27, 2026 17:34Elijah KinElijah KinScore: 2,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 17:352,02714,915,7343,823,0001,245,0002,117,632
2Aug 27, 2026 17:352,03814,904,4023,833,0001,262,0002,117,632
3Aug 27, 2026 17:352,29615,464,2574,486,0001,254,0002,117,632
4Aug 27, 2026 17:352,30415,511,3814,524,0001,237,0002,117,632
5Aug 27, 2026 17:352,31017,465,7824,508,0001,268,0002,117,632
6Aug 27, 2026 17:352,31015,497,1094,527,0001,248,0002,117,632
7Aug 27, 2026 17:352,31615,683,1044,547,0001,244,0002,117,632
8Aug 27, 2026 17:352,36216,405,4404,648,0001,259,0002,117,632
9Aug 27, 2026 17:352,36716,451,1164,822,0001,097,0002,117,632