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 listAug 29, 2026 17:26Victor MerckléVictor MerckléScore: 1,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 17:291,44812,017,2862,546,0001,074,0002,117,632stderr
2Aug 29, 2026 17:291,46011,832,5082,576,0001,076,0002,117,632stderr
3Aug 29, 2026 17:291,46011,844,1682,577,0001,073,0002,117,632stderr
4Aug 29, 2026 17:291,48911,871,5672,599,0001,125,0002,117,632stderr
5Aug 29, 2026 17:291,49418,553,9862,608,0001,128,0002,117,632stderr
6Aug 29, 2026 17:291,52812,255,0732,577,0001,245,0002,117,632stderr
7Aug 29, 2026 17:291,56612,369,7222,793,0001,123,0002,117,632stderr
8Aug 29, 2026 17:291,56812,958,4652,797,0001,123,0002,117,632stderr
9Aug 29, 2026 17:291,56912,133,5482,797,0001,126,0002,117,632stderr