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 16:04Josu San MartinJosu San MartinScore: 27,324Success
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 16:0427,20895,835,90361,018,0007,002,0002,514,944
2Dec 29, 2025 16:0427,32494,137,62859,270,0009,041,0002,322,432
3Dec 29, 2025 16:0428,354103,409,28061,901,0008,985,0002,527,232