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:11Josu San MartinJosu San MartinScore: 27,478Success
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:1127,27091,761,99560,156,0008,020,0002,519,040
2Dec 29, 2025 16:1127,47896,902,83661,625,0007,071,0002,514,944
3Dec 29, 2025 16:1128,21393,777,31361,464,0009,068,0002,445,312