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 listMar 12, 2026 02:30olliecrowolliecrowScore: 9,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 02:309,41046,759,15019,434,0004,091,0002,338,816
2Mar 12, 2026 02:309,41843,253,11918,426,0005,118,0002,326,528
3Mar 12, 2026 02:309,42049,875,03219,455,0004,095,0002,314,240
4Mar 12, 2026 02:309,43044,569,09519,475,0004,100,0002,297,856
5Mar 12, 2026 02:309,43844,632,92818,465,0005,129,0002,519,040
6Mar 12, 2026 02:309,46049,415,23317,481,0006,169,0002,383,872
7Mar 12, 2026 02:309,49353,712,82920,638,0003,095,0002,330,624
8Mar 12, 2026 02:309,49552,626,54619,610,0004,128,0002,342,912
9Mar 12, 2026 02:309,61247,966,92618,023,0006,007,0002,318,336