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:59olliecrowolliecrowScore: 14,346Success
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:5914,22460,223,04430,480,0005,080,0002,383,872
2Mar 4, 2026 19:5914,34663,770,52329,889,0005,977,0002,310,144
3Mar 4, 2026 19:5914,37058,366,08829,938,0005,987,0002,482,176