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 listMay 30, 2026 02:15Victor MerckléVictor MerckléScore: 2,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 02:182,52414,111,5044,978,0001,333,0002,113,536
2May 30, 2026 02:182,53014,070,0594,997,0001,328,0002,113,536
3May 30, 2026 02:182,53614,089,8185,012,0001,329,0002,113,536
4May 30, 2026 02:182,54015,426,3555,020,0001,330,0002,113,536
5May 30, 2026 02:182,57015,106,7365,070,0001,355,0002,113,536
6May 30, 2026 02:182,60814,439,4954,245,0002,277,0002,113,536
7May 30, 2026 02:182,62114,460,8855,225,0001,328,0002,113,536
8May 30, 2026 02:182,63016,479,6165,244,0001,332,0002,113,536
9May 30, 2026 02:182,70715,376,1064,490,0002,278,0002,113,536