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 4, 2026 18:21olliecrowolliecrowScore: 41,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 18:2141,016123,271,02397,515,0005,026,0002,400,256
2Mar 4, 2026 18:2141,213129,614,15399,032,0004,001,0002,301,952
3Mar 4, 2026 18:2141,250129,541,68699,122,0004,004,0002,408,448