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:53olliecrowolliecrowScore: 18,800Success
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:5318,77474,196,57940,944,0005,991,0002,924,544
2Mar 4, 2026 18:5318,80071,645,26541,000,0006,000,0002,867,200
3Mar 4, 2026 18:5318,82475,264,69239,050,0008,010,0002,969,600