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 20:20Yuriy LyfenkoYuriy LyfenkoScore: 3,772Success
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 20:203,77030,927,1048,377,0001,047,0002,486,272
2Mar 21, 2026 20:203,77230,191,6269,429,00002,482,176
3Mar 21, 2026 20:203,91728,750,3999,792,00002,498,560