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:19Elijah KinElijah KinScore: 2,509Success
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:202,26118,282,3484,416,0001,238,0002,117,632
2Aug 27, 2026 21:202,48215,939,4994,960,0001,247,0002,117,632
3Aug 27, 2026 21:202,48515,969,9144,950,0001,263,0002,117,632
4Aug 27, 2026 21:202,50616,144,5365,016,0001,250,0002,117,632
5Aug 27, 2026 21:202,50916,582,8395,007,0001,267,0002,117,632
6Aug 27, 2026 21:202,51416,052,7605,032,0001,254,0002,117,632
7Aug 27, 2026 21:202,51817,455,5245,044,0001,253,0002,117,632
8Aug 27, 2026 21:202,54416,059,1485,110,0001,250,0002,117,632
9Aug 27, 2026 21:202,72017,292,4625,468,0001,332,0002,117,632