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 listFeb 6, 2026 01:36Josu San MartinJosu San MartinScore: 5,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 01:365,32424,898,2909,215,0004,095,0002,326,528
2Feb 6, 2026 01:365,37031,511,53410,327,0003,098,0002,510,848
3Feb 6, 2026 01:365,40329,116,3017,273,0006,234,0002,465,792