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:00Josu San MartinJosu San MartinScore: 27,364Success
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:0027,30493,374,17458,223,00010,038,0002,527,232
2Dec 29, 2025 16:0027,36499,592,12358,351,00010,060,0002,531,328
3Dec 29, 2025 16:0027,43299,013,43761,520,0007,059,0002,306,048