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 19, 2026 05:07olliecrowolliecrowScore: 4,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 05:074,94029,608,60110,293,0002,058,0002,408,448
2Apr 19, 2026 05:074,98527,789,16110,385,0002,077,0002,330,624
3Apr 19, 2026 05:075,23734,712,7378,057,0005,035,0002,310,144