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 19, 2026 12:05Dominique GarmierDominique GarmierScore: 9,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 12:058,94244,887,84917,274,0005,080,0002,277,376
2Mar 19, 2026 12:059,00846,311,76819,450,0003,071,0002,457,600
3Mar 19, 2026 12:059,10552,415,85415,835,0006,928,0002,273,280