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 03:34Victor MerckléVictor MerckléScore: 2,540Success
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 03:362,52414,108,1894,979,0001,332,0002,113,536
2May 30, 2026 03:362,53114,923,1534,998,0001,331,0002,113,536
3May 30, 2026 03:362,53215,846,9574,995,0001,337,0002,113,536
4May 30, 2026 03:362,53814,310,6415,012,0001,334,0002,113,536
5May 30, 2026 03:362,54014,008,5955,015,0001,337,0002,113,536
6May 30, 2026 03:362,60416,632,4795,141,0001,370,0002,113,536
7May 30, 2026 03:362,62014,418,2895,219,0001,332,0002,113,536
8May 30, 2026 03:362,67115,460,8615,329,0001,350,0002,113,536
9May 30, 2026 03:362,67715,085,9174,424,0002,270,0002,113,536