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:00T PrathamT PrathamScore: 411,070Success
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:00410,8941,053,156,3241,016,245,00010,991,0002,486,272
2Jul 6, 2025 19:00411,0701,052,802,7951,017,679,0009,996,0002,342,912
3Jul 6, 2025 19:00411,4341,059,470,4211,018,591,0009,995,0002,330,624