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 11:39Victor MerckléVictor MerckléScore: 1,788Success
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 11:431,73612,784,2043,246,0001,094,0002,117,632stderr
2Aug 29, 2026 11:431,75212,826,8403,272,0001,108,0002,117,632stderr
3Aug 29, 2026 11:431,75612,780,5473,277,0001,115,0002,117,632stderr
4Aug 29, 2026 11:431,75712,895,5012,881,0001,513,0002,117,632stderr
5Aug 29, 2026 11:431,78812,853,3643,218,0001,252,0002,117,632stderr
6Aug 29, 2026 11:431,80412,900,5533,367,0001,143,0002,117,632stderr
7Aug 29, 2026 11:431,82622,798,6013,379,0001,187,0002,117,632stderr
8Aug 29, 2026 11:431,82613,579,5663,098,0001,468,0002,117,632stderr
9Aug 29, 2026 11:431,83813,639,1213,143,0001,453,0002,117,632stderr