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 listMar 4, 2026 19:23olliecrowolliecrowScore: 14,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 19:2314,04061,213,55630,086,0005,014,0002,408,448
2Mar 4, 2026 19:2314,07056,583,78330,150,0005,025,0002,387,968
3Mar 4, 2026 19:2314,08256,368,94629,170,0006,035,0002,404,352
4Mar 4, 2026 19:2314,10058,148,94828,201,0007,050,0002,408,448
5Mar 4, 2026 19:2314,12759,976,18030,272,0005,045,0002,387,968
6Mar 4, 2026 19:2314,13958,171,46830,298,0005,049,0002,404,352
7Mar 4, 2026 19:2314,16257,996,99729,335,0006,069,0002,437,120
8Mar 4, 2026 19:2314,16658,763,64232,381,0003,035,0002,371,584
9Mar 4, 2026 19:2314,19256,196,71329,399,0006,082,0002,387,968