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 listJul 8, 2026 01:38Victor MerckléVictor MerckléScore: 1,652Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 01:391,59812,094,1032,877,0001,118,0002,117,632stderr
2Jul 8, 2026 01:391,60012,079,6102,882,0001,118,0002,117,632stderr
3Jul 8, 2026 01:391,60912,026,1662,909,0001,114,0002,117,632stderr
4Jul 8, 2026 01:391,63712,166,6602,936,0001,157,0002,117,632stderr
5Jul 8, 2026 01:391,65212,171,2683,011,0001,119,0002,117,632stderr
6Jul 8, 2026 01:391,66712,282,8603,050,0001,119,0002,117,632stderr
7Jul 8, 2026 01:391,68812,202,8113,086,0001,136,0002,117,632stderr
8Jul 8, 2026 01:391,68912,333,6413,081,0001,142,0002,117,632stderr
9Jul 8, 2026 01:391,70812,805,7213,117,0001,153,0002,117,632stderr