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 00:25Victor MerckléVictor MerckléScore: 2,598Success
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 00:262,53414,491,5295,001,0001,335,0002,113,536
2May 30, 2026 00:262,53916,949,8435,010,0001,338,0002,113,536
3May 30, 2026 00:262,54415,683,2535,023,0001,338,0002,113,536
4May 30, 2026 00:262,56414,788,3745,078,0001,334,0002,113,536
5May 30, 2026 00:262,59814,263,4375,131,0001,366,0002,113,536
6May 30, 2026 00:262,61416,020,0515,204,0001,333,0002,113,536
7May 30, 2026 00:262,62916,543,1005,238,0001,336,0002,113,536
8May 30, 2026 00:262,63516,252,7125,255,0001,334,0002,113,536
9May 30, 2026 00:262,69014,486,0174,429,0002,297,0002,113,536