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 06:02Victor MerckléVictor MerckléScore: 2,606Success
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 06:042,52318,324,6804,976,0001,333,0002,113,536
2May 30, 2026 06:042,53217,264,0444,997,0001,334,0002,113,536
3May 30, 2026 06:042,54714,334,3265,032,0001,337,0002,113,536
4May 30, 2026 06:042,59316,108,5255,115,0001,369,0002,113,536
5May 30, 2026 06:042,60616,304,3254,243,0002,272,0002,113,536
6May 30, 2026 06:042,61816,173,9155,219,0001,327,0002,113,536
7May 30, 2026 06:042,62615,666,5275,234,0001,333,0002,113,536
8May 30, 2026 06:042,62716,008,1405,234,0001,335,0002,113,536
9May 30, 2026 06:042,69618,627,5364,450,0002,290,0002,113,536