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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 16:199,56041,180,65621,909,0001,991,0002,371,584
2Mar 24, 2026 16:199,59155,173,77320,980,0002,997,0002,375,680
3Mar 24, 2026 16:199,68647,377,16119,171,0005,045,0002,371,584