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 17, 2026 21:05olliecrowolliecrowScore: 13,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 21:0513,30756,672,28331,252,0002,016,0002,457,600
2Apr 17, 2026 21:0513,31663,245,82331,274,0002,017,0002,514,944
3Apr 17, 2026 21:0513,57060,072,01633,925,00002,379,776