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 29, 2026 23:21Victor MerckléVictor MerckléScore: 2,591Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 23:232,52114,885,5384,976,0001,328,0002,113,536
2May 29, 2026 23:232,52615,199,9284,990,0001,327,0002,113,536
3May 29, 2026 23:232,53714,428,1225,014,0001,330,0002,113,536
4May 29, 2026 23:232,55714,158,5985,049,0001,344,0002,113,536
5May 29, 2026 23:232,59115,933,1495,113,0001,366,0002,113,536
6May 29, 2026 23:232,62214,324,3985,232,0001,324,0002,113,536
7May 29, 2026 23:232,62715,278,7645,237,0001,332,0002,113,536
8May 29, 2026 23:232,65414,341,4005,293,0001,343,0002,113,536
9May 29, 2026 23:232,68914,426,5364,442,0002,282,0002,113,536