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 listSep 15, 2026 17:20Josu San MartinJosu San MartinScore: 2,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 17:202,79015,584,3875,867,0001,109,0002,117,632
2Sep 15, 2026 17:202,79515,634,7485,879,0001,109,0002,117,632
3Sep 15, 2026 17:202,79915,607,7775,886,0001,112,0002,117,632
4Sep 15, 2026 17:202,80115,621,8695,893,0001,110,0002,117,632
5Sep 15, 2026 17:202,80115,662,4545,893,0001,110,0002,117,632
6Sep 15, 2026 17:202,80415,621,6145,903,0001,107,0002,117,632
7Sep 15, 2026 17:202,80815,676,2415,909,0001,113,0002,117,632
8Sep 15, 2026 17:202,81715,674,5985,928,0001,115,0002,117,632
9Sep 15, 2026 17:202,82615,729,4465,949,0001,117,0002,117,632