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 19, 2026 17:36Dominique GarmierDominique GarmierScore: 9,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 17:369,30647,343,91618,207,0005,057,0002,514,944
2Mar 19, 2026 17:369,37455,982,16216,600,0006,835,0002,322,432
3Mar 19, 2026 17:369,46347,167,02621,600,0002,057,0002,514,944