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 listJul 6, 2025 19:07T PrathamT PrathamScore: 375,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 19:07374,753964,242,977933,884,0002,999,0002,461,696
2Jul 6, 2025 19:07374,893962,737,467930,238,0006,994,0002,322,432
3Jul 6, 2025 19:07374,951964,897,996930,383,0006,995,0002,260,992
4Jul 6, 2025 19:07375,107963,721,178930,769,0006,998,0002,347,008
5Jul 6, 2025 19:07375,149965,922,880934,874,0002,999,0002,478,080
6Jul 6, 2025 19:07375,202972,362,112933,005,0005,000,0002,519,040
7Jul 6, 2025 19:07375,761963,813,714934,407,0004,996,0002,437,120
8Jul 6, 2025 19:07375,855968,633,772931,641,0007,996,0002,265,088
9Jul 6, 2025 19:07375,984967,581,133933,961,0005,999,0002,260,992