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 29, 2026 21:37Victor MerckléVictor MerckléScore: 2,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 21:392,53216,051,1205,006,0001,326,0002,113,536
2May 29, 2026 21:392,54015,802,0385,023,0001,329,0002,113,536
3May 29, 2026 21:392,54716,281,0225,037,0001,331,0002,113,536
4May 29, 2026 21:392,54815,812,7605,041,0001,329,0002,113,536
5May 29, 2026 21:392,55717,382,8425,060,0001,334,0002,113,536
6May 29, 2026 21:392,57314,303,9225,086,0001,348,0002,113,536
7May 29, 2026 21:392,60014,279,0705,138,0001,363,0002,113,536
8May 29, 2026 21:392,63814,386,8995,265,0001,330,0002,113,536
9May 29, 2026 21:392,70614,779,0984,494,0002,273,0002,113,536