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 10:30Victor MerckléVictor MerckléScore: 2,634Success
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 10:322,54815,872,4815,039,0001,331,0002,113,536
2May 30, 2026 10:322,56114,914,9855,067,0001,336,0002,113,536
3May 30, 2026 10:322,56414,413,2145,079,0001,332,0002,113,536
4May 30, 2026 10:322,57214,806,8785,096,0001,334,0002,113,536
5May 30, 2026 10:322,63416,701,7735,258,0001,329,0002,113,536
6May 30, 2026 10:322,63414,279,6025,259,0001,327,0002,113,536
7May 30, 2026 10:322,64214,254,8055,274,0001,332,0002,113,536
8May 30, 2026 10:322,68414,328,0644,425,0002,286,0002,113,536
9May 30, 2026 10:322,70614,507,4044,490,0002,276,0002,113,536