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 07:01Victor MerckléVictor MerckléScore: 2,634Success
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 07:032,52314,235,1284,976,0001,332,0002,113,536
2May 30, 2026 07:032,59614,134,0055,163,0001,329,0002,113,536
3May 30, 2026 07:032,61415,689,5755,207,0001,330,0002,113,536
4May 30, 2026 07:032,62614,407,3965,235,0001,331,0002,113,536
5May 30, 2026 07:032,63414,347,9615,251,0001,334,0002,113,536
6May 30, 2026 07:032,63614,994,1665,255,0001,337,0002,113,536
7May 30, 2026 07:032,64314,346,2405,263,0001,345,0002,113,536
8May 30, 2026 07:032,65214,219,1065,271,0001,360,0002,113,536
9May 30, 2026 07:032,68414,429,9604,437,0002,273,0002,113,536