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 listMay 21, 2026 22:06Jacob McDanielJacob McDanielScore: 2,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 22:072,45117,546,6634,929,0001,199,0002,117,632
2May 21, 2026 22:072,45217,558,8464,936,0001,194,0002,117,632
3May 21, 2026 22:072,45620,177,5724,938,0001,202,0002,117,632
4May 21, 2026 22:072,46217,185,0234,941,0001,215,0002,117,632
5May 21, 2026 22:072,47616,366,7754,973,0001,217,0002,117,632
6May 21, 2026 22:072,47917,171,7444,985,0001,213,0002,117,632
7May 21, 2026 22:072,50318,475,9425,020,0001,238,0002,117,632
8May 21, 2026 22:072,57017,120,9455,163,0001,264,0002,117,632
9May 21, 2026 22:072,72429,909,2755,515,0001,295,0002,117,632