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 02:08Victor MerckléVictor MerckléScore: 2,549Success
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 02:102,52415,277,0924,978,0001,334,0002,113,536
2May 30, 2026 02:102,52814,129,8534,989,0001,332,0002,113,536
3May 30, 2026 02:102,53916,096,3845,009,0001,339,0002,113,536
4May 30, 2026 02:102,53916,846,9665,009,0001,339,0002,113,536
5May 30, 2026 02:102,54916,325,7095,025,0001,348,0002,113,536
6May 30, 2026 02:102,55015,904,9115,028,0001,347,0002,113,536
7May 30, 2026 02:102,59214,984,5925,111,0001,371,0002,113,536
8May 30, 2026 02:102,62716,449,1675,237,0001,331,0002,113,536
9May 30, 2026 02:102,64616,310,5715,280,0001,335,0002,113,536