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 1, 2026 14:03Victor MerckléVictor MerckléScore: 4,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 14:083,94525,338,5896,905,0002,959,0002,359,296
2May 1, 2026 14:083,96128,254,8616,932,0002,971,0002,363,392
3May 1, 2026 14:083,96329,531,2584,954,0004,954,0002,347,008
4May 1, 2026 14:083,98529,285,3465,978,0003,985,0002,351,104
5May 1, 2026 14:084,04627,472,7845,058,0005,058,0002,355,200
6May 1, 2026 14:084,10024,383,3896,151,0004,101,0002,359,296
7May 1, 2026 14:084,13628,608,2019,307,0001,034,0002,359,296
8May 1, 2026 14:084,19832,823,8658,397,0002,099,0002,359,296
9May 1, 2026 14:084,27128,017,5015,339,0005,339,0002,355,200