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 16:06Dominique GarmierDominique GarmierScore: 15,259Success
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 16:0615,20761,889,66533,015,0005,002,0002,424,832
2Mar 19, 2026 16:0615,25961,442,64332,124,0006,023,0002,441,216
3Mar 19, 2026 16:0615,40958,884,41335,481,0003,041,0002,269,184