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 listNov 18, 2025 22:04Yuriy LyfenkoYuriy LyfenkoScore: 4,014Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2025 22:023,98630,162,0946,976,0002,989,0002,330,624
2Nov 18, 2025 22:023,99234,683,6966,986,0002,994,0002,334,720
3Nov 18, 2025 22:023,99827,209,6827,997,0001,999,0002,359,296
4Nov 18, 2025 22:024,00025,980,1449,001,0001,000,0002,310,144
5Nov 18, 2025 22:024,00529,813,4348,011,0002,002,0002,338,816
6Nov 18, 2025 22:024,01028,496,7299,023,0001,002,0002,416,640
7Nov 18, 2025 22:044,01431,831,0828,028,0002,007,0002,330,624
8Nov 18, 2025 22:024,02129,071,7339,048,0001,005,0002,420,736
9Nov 18, 2025 22:024,04224,488,6488,085,0002,021,0002,420,736
10Nov 18, 2025 22:044,04529,941,3348,090,0002,022,0002,469,888
11Nov 18, 2025 22:044,07731,223,9598,155,0002,038,0002,338,816
12Nov 18, 2025 22:024,14026,003,0976,211,0004,140,0002,347,008