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 17, 2026 14:55Dominique GarmierDominique GarmierScore: 15,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 14:5515,40860,886,94535,480,0003,041,0002,387,968
2Mar 17, 2026 14:5515,47867,833,59733,604,0005,091,0002,437,120
3Mar 17, 2026 14:5515,55267,592,89133,897,0004,984,0002,441,216