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 listDec 29, 2025 17:45KeefeKeefeScore: 15,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 17:4515,73662,024,20834,296,0005,043,0002,310,144
2Dec 29, 2025 17:4515,74161,708,78836,325,0003,027,0002,273,280
3Dec 29, 2025 17:4515,78666,979,58436,430,0003,035,0002,412,544
4Dec 29, 2025 17:4515,79060,660,43733,402,0006,073,0002,310,144
5Dec 29, 2025 17:4515,89962,311,40037,710,0002,038,0002,301,952
6Dec 29, 2025 17:4515,94465,261,29535,874,0003,986,0002,482,176
7Dec 29, 2025 17:4515,95568,487,24233,905,0005,983,0002,433,024
8Dec 29, 2025 17:4515,96364,849,78737,913,0001,995,0002,412,544
9Dec 29, 2025 17:4516,01263,907,26637,029,0003,002,0002,375,680