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 listJun 30, 2026 17:38Victor MerckléVictor MerckléScore: 1,853Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 17:401,73412,392,1583,124,0001,212,0002,117,632stderr
2Jun 30, 2026 17:401,75412,304,2843,158,0001,229,0002,117,632stderr
3Jun 30, 2026 17:401,76112,357,7963,168,0001,235,0002,117,632stderr
4Jun 30, 2026 17:401,77412,409,8943,198,0001,238,0002,117,632stderr
5Jun 30, 2026 17:401,85312,607,5733,390,0001,243,0002,117,632stderr
6Jun 30, 2026 17:401,87012,650,3683,418,0001,259,0002,117,632stderr
7Jun 30, 2026 17:401,88012,642,4243,474,0001,228,0002,117,632stderr
8Jun 30, 2026 17:401,88613,068,7893,438,0001,278,0002,117,632stderr
9Jun 30, 2026 17:401,92212,766,0133,344,0001,463,0002,117,632stderr