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 23, 2026 14:40Andrew EpsteinAndrew EpsteinScore: 1,830Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 12:27Tomislav Tunkovic25.62CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 14:401,78422,871,6783,253,0001,208,0002,117,632
2Aug 23, 2026 14:401,82014,344,4833,425,0001,125,0002,117,632
3Aug 23, 2026 14:401,82314,300,9493,413,0001,145,0002,117,632
4Aug 23, 2026 14:401,82614,456,2383,426,0001,139,0002,117,632
5Aug 23, 2026 14:401,83014,329,4273,436,0001,139,0002,117,632
6Aug 23, 2026 14:401,83614,372,3093,441,0001,149,0002,117,632
7Aug 23, 2026 14:401,83814,499,0723,445,0001,151,0002,117,632
8Aug 23, 2026 14:401,86114,405,8793,434,0001,219,0002,117,632
9Aug 23, 2026 14:401,87114,411,4233,418,0001,260,0002,117,632