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 19:32olliecrowolliecrowScore: 15,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 4, 2026 19:3214,95860,603,72332,341,0005,053,0002,412,544
2Mar 4, 2026 19:3215,04062,480,42733,535,0004,064,0002,408,448
3Mar 4, 2026 19:3215,16262,265,82432,917,0004,987,0002,347,008