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 listMar 21, 2026 05:33Josu San MartinJosu San MartinScore: 3,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 05:333,22621,749,9526,050,0002,016,0002,297,856
2Mar 21, 2026 05:333,24426,923,8915,069,0003,041,0002,314,240
3Mar 21, 2026 05:333,32028,195,6905,188,0003,113,0002,297,856