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 listFeb 7, 2026 21:34T PrathamT PrathamScore: 9,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 21:349,29651,618,32218,187,0005,052,0002,523,136
2Feb 7, 2026 21:349,31946,418,51919,246,0004,051,0002,519,040
3Feb 7, 2026 21:349,54847,766,52715,913,0007,956,0002,437,120