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 listMay 19, 2026 08:29Jacob McDanielJacob McDanielScore: 2,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 08:302,71517,987,3875,607,0001,181,0002,117,632
2May 19, 2026 08:302,71816,377,3025,627,0001,170,0002,117,632
3May 19, 2026 08:302,73416,409,6935,667,0001,168,0002,117,632
4May 19, 2026 08:302,74016,112,7955,677,0001,175,0002,117,632
5May 19, 2026 08:302,74018,441,5945,669,0001,181,0002,113,536
6May 19, 2026 08:302,74916,188,4515,696,0001,178,0002,117,632
7May 19, 2026 08:302,76116,626,9985,666,0001,237,0002,117,632
8May 19, 2026 08:302,76617,736,8815,710,0001,207,0002,117,632
9May 19, 2026 08:302,78316,176,7015,718,0001,241,0002,117,632