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 listApr 9, 2026 13:28olliecrowolliecrowScore: 38,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2026 13:2838,784131,862,07693,961,0002,998,0002,514,944
2Apr 9, 2026 13:2838,899119,401,08392,236,0005,012,0002,531,328
3Apr 9, 2026 13:2838,920121,947,13893,288,0004,012,0002,498,560