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 listApr 21, 2026 09:24Dominique GarmierDominique GarmierScore: 8,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 09:248,45236,816,90014,087,0007,043,0002,510,848
2Apr 21, 2026 09:248,46543,533,14217,132,0004,031,0002,289,664
3Apr 21, 2026 09:248,47344,542,41518,157,0003,026,0002,260,992
4Apr 21, 2026 09:248,54143,519,80916,270,0005,084,0002,510,848
5Apr 21, 2026 09:248,59838,655,14018,426,0003,071,0002,428,928
6Apr 21, 2026 09:248,60045,112,94616,381,0005,119,0002,252,800
7Apr 21, 2026 09:248,66448,048,46816,503,0005,157,0002,510,848
8Apr 21, 2026 09:248,70051,445,80518,645,0003,107,0002,252,800
9Apr 21, 2026 09:248,93542,359,71917,262,0005,077,0002,510,848