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 listSep 10, 2026 08:58Victor MerckléVictor MerckléScore: 3,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 09:013,48017,509,1607,466,0001,236,0002,121,728stderr
2Sep 10, 2026 09:013,48817,258,5067,472,0001,250,0002,121,728stderr
3Sep 10, 2026 09:013,49017,731,6597,303,0001,422,0002,121,728stderr
4Sep 10, 2026 09:013,49417,631,5847,492,0001,244,0002,121,728stderr
5Sep 10, 2026 09:013,50017,575,9837,493,0001,257,0002,121,728stderr
6Sep 10, 2026 09:013,50017,199,0027,332,0001,418,0002,121,728stderr
7Sep 10, 2026 09:013,50217,606,1857,490,0001,266,0002,121,728stderr
8Sep 10, 2026 09:013,50217,029,9687,640,0001,115,0002,121,728stderr
9Sep 10, 2026 09:013,51618,721,0867,505,0001,287,0002,121,728stderr