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 listSep 14, 2026 14:16Victor MerckléVictor MerckléScore: 1,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 14:171,40012,178,7462,429,0001,071,0002,117,632stderr
2Sep 14, 2026 14:171,40612,327,8072,440,0001,075,0002,117,632stderr
3Sep 14, 2026 14:171,43812,373,9142,517,0001,079,0002,117,632stderr
4Sep 14, 2026 14:171,45112,277,4532,524,0001,104,0002,117,632stderr
5Sep 14, 2026 14:171,45812,541,6612,538,0001,108,0002,117,632stderr
6Sep 14, 2026 14:171,49812,465,0792,606,0001,140,0002,117,632stderr
7Sep 14, 2026 14:171,50612,598,8862,637,0001,130,0002,117,632stderr
8Sep 14, 2026 14:171,51713,152,2402,641,0001,152,0002,117,632stderr
9Sep 14, 2026 14:171,52813,152,2292,660,0001,161,0002,117,632stderr