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:04olliecrowolliecrowScore: 18,330Success
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:0418,27873,771,15739,603,0006,092,0002,404,352
2Mar 4, 2026 19:0418,33069,169,04939,847,0005,977,0002,473,984
3Mar 4, 2026 19:0418,37868,892,47140,952,0004,994,0002,392,064