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 19, 2026 16:42Dominique GarmierDominique GarmierScore: 9,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 16:429,02044,763,17918,451,0004,100,0002,289,664
2Mar 19, 2026 16:429,04049,897,74717,463,0005,136,0002,469,888
3Mar 19, 2026 16:429,15650,446,53517,915,0004,976,0002,486,272