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 01:35Victor MerckléVictor MerckléScore: 2,560Success
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 01:372,52014,739,3214,976,0001,326,0002,113,536
2May 30, 2026 01:372,53014,134,6064,995,0001,331,0002,113,536
3May 30, 2026 01:372,53115,193,4054,999,0001,329,0002,113,536
4May 30, 2026 01:372,53214,291,7745,001,0001,330,0002,113,536
5May 30, 2026 01:372,56014,193,3355,055,0001,345,0002,113,536
6May 30, 2026 01:372,56415,454,0605,060,0001,351,0002,113,536
7May 30, 2026 01:372,62814,265,1855,240,0001,330,0002,113,536
8May 30, 2026 01:372,63614,380,5805,261,0001,331,0002,113,536
9May 30, 2026 01:372,68316,487,5944,434,0002,274,0002,113,536