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 01:32Victor MerckléVictor MerckléScore: 2,544Success
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 01:342,52815,260,6274,992,0001,328,0002,113,536
2May 30, 2026 01:342,53315,451,1785,005,0001,329,0002,113,536
3May 30, 2026 01:342,53414,994,1025,007,0001,329,0002,113,536
4May 30, 2026 01:342,54115,059,0135,021,0001,332,0002,113,536
5May 30, 2026 01:342,54414,310,0615,030,0001,331,0002,113,536
6May 30, 2026 01:342,60014,130,4365,135,0001,367,0002,113,536
7May 30, 2026 01:342,61814,202,9205,220,0001,326,0002,113,536
8May 30, 2026 01:342,62214,871,7544,286,0002,271,0002,113,536
9May 30, 2026 01:342,68614,430,8064,444,0002,272,0002,113,536