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 4, 2026 08:53Victor MerckléVictor MerckléScore: 1,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 08:581,42812,077,4392,499,0001,073,0002,117,632stderr
2Sep 4, 2026 08:581,43411,978,7952,516,0001,071,0002,117,632stderr
3Sep 4, 2026 08:581,44212,051,6662,533,0001,073,0002,117,632stderr
4Sep 4, 2026 08:581,44712,052,2602,540,0001,079,0002,117,632stderr
5Sep 4, 2026 08:581,47611,928,0492,576,0001,114,0002,117,632stderr
6Sep 4, 2026 08:581,48411,964,0432,601,0001,111,0002,117,632stderr
7Sep 4, 2026 08:581,52512,264,5322,701,0001,112,0002,117,632stderr
8Sep 4, 2026 08:581,52612,387,1922,670,0001,146,0002,117,632stderr
9Sep 4, 2026 08:581,59412,292,5222,737,0001,248,0002,117,632stderr