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 21:43Elijah KinElijah KinScore: 2,316Success
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 21:442,02119,141,2273,800,0001,253,0002,117,632
2Aug 27, 2026 21:442,23215,316,4914,322,0001,259,0002,117,632
3Aug 27, 2026 21:442,29815,631,6364,496,0001,250,0002,117,632
4Aug 27, 2026 21:442,30815,502,6984,521,0001,251,0002,117,632
5Aug 27, 2026 21:442,31615,554,9454,532,0001,259,0002,117,632
6Aug 27, 2026 21:442,31616,238,3904,542,0001,250,0002,117,632
7Aug 27, 2026 21:442,32016,344,1334,546,0001,256,0002,117,632
8Aug 27, 2026 21:442,34916,387,6694,630,0001,243,0002,117,632
9Aug 27, 2026 21:442,41917,597,1094,770,0001,279,0002,117,632