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 15, 2026 09:02Victor MerckléVictor MerckléScore: 1,426Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 09:061,36712,209,7661,877,0001,541,0002,117,632stderr
2Sep 15, 2026 09:061,37212,180,6471,893,0001,538,0002,117,632stderr
3Sep 15, 2026 09:061,37911,961,8951,855,0001,594,0002,117,632stderr
4Sep 15, 2026 09:061,41812,218,5041,984,0001,561,0002,117,632stderr
5Sep 15, 2026 09:061,42612,094,7922,414,0001,153,0002,117,632stderr
6Sep 15, 2026 09:061,43412,348,7942,051,0001,535,0002,117,632stderr
7Sep 15, 2026 09:061,44012,266,2922,032,0001,568,0002,117,632stderr
8Sep 15, 2026 09:061,44013,693,1442,000,0001,602,0002,117,632stderr
9Sep 15, 2026 09:061,50412,488,9332,585,0001,175,0002,117,632stderr