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 13:08Victor MerckléVictor MerckléScore: 2,619Success
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 13:102,52716,364,7934,985,0001,334,0002,113,536
2May 30, 2026 13:102,54013,990,1465,016,0001,334,0002,113,536
3May 30, 2026 13:102,54415,903,8135,023,0001,337,0002,113,536
4May 30, 2026 13:102,60915,380,6665,184,0001,339,0002,113,536
5May 30, 2026 13:102,61916,345,2945,221,0001,328,0002,113,536
6May 30, 2026 13:102,62415,437,1754,289,0002,273,0002,113,536
7May 30, 2026 13:102,64614,350,9365,284,0001,332,0002,113,536
8May 30, 2026 13:102,64715,105,1785,284,0001,335,0002,113,536
9May 30, 2026 13:102,65214,599,6165,284,0001,347,0002,113,536