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 listApr 13, 2026 14:41limanjun99limanjun99Score: 3,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 14:413,01022,250,4905,376,0002,150,0002,285,568
2Apr 13, 2026 14:413,02226,553,4915,396,0002,158,0002,293,760
3Apr 13, 2026 14:413,02825,142,3176,490,0001,081,0002,293,760
4Apr 13, 2026 14:413,03425,930,5005,418,0002,167,0002,531,328
5Apr 13, 2026 14:413,03823,070,0155,426,0002,170,0002,273,280
6Apr 13, 2026 14:413,04128,791,7745,430,0002,172,0002,293,760
7Apr 13, 2026 14:413,05227,635,1285,451,0002,180,0002,383,872
8Apr 13, 2026 14:413,16522,759,7825,934,0001,978,0002,293,760
9Apr 13, 2026 14:413,17023,422,3625,944,0001,981,0002,265,088