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 2, 2026 05:19Victor MerckléVictor MerckléScore: 2,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 05:212,15713,039,5604,153,0001,241,0002,113,536
2Jun 2, 2026 05:212,20713,203,0814,279,0001,240,0002,113,536
3Jun 2, 2026 05:212,21213,263,3574,256,0001,274,0002,113,536
4Jun 2, 2026 05:212,21613,223,1504,295,0001,247,0002,113,536
5Jun 2, 2026 05:212,21813,169,1954,266,0001,280,0002,113,536
6Jun 2, 2026 05:212,21913,166,1574,291,0001,258,0002,113,536
7Jun 2, 2026 05:212,22213,167,3154,276,0001,280,0002,113,536
8Jun 2, 2026 05:212,25613,238,0634,390,0001,250,0002,113,536
9Jun 2, 2026 05:212,31113,378,4183,652,0002,127,0002,113,536