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 04:06Victor MerckléVictor MerckléScore: 2,631Success
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 04:072,52616,328,2334,983,0001,333,0002,113,536
2May 30, 2026 04:072,54118,968,3875,019,0001,335,0002,113,536
3May 30, 2026 04:072,54315,402,3605,022,0001,337,0002,113,536
4May 30, 2026 04:072,63015,486,7665,243,0001,334,0002,113,536
5May 30, 2026 04:072,63115,540,7315,241,0001,338,0002,113,536
6May 30, 2026 04:072,63314,251,3565,246,0001,338,0002,113,536
7May 30, 2026 04:072,64915,309,0215,275,0001,348,0002,113,536
8May 30, 2026 04:072,67316,804,8004,407,0002,277,0002,113,536
9May 30, 2026 04:072,69416,699,6074,457,0002,278,0002,113,536