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 26, 2026 11:04olliecrowolliecrowScore: 4,590Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 11:084,53133,094,8167,209,0004,119,0002,547,712
2Apr 26, 2026 11:084,53831,061,7148,252,0003,094,0002,539,520
3Apr 26, 2026 11:084,54832,543,4777,237,0004,135,0002,539,520
4Apr 26, 2026 11:084,56131,439,5117,257,0004,147,0002,347,008
5Apr 26, 2026 11:084,59028,176,7117,302,0004,173,0002,543,616
6Apr 26, 2026 11:084,67028,539,4989,554,0002,123,0002,547,712
7Apr 26, 2026 11:084,75830,959,0255,948,0005,948,0002,547,712
8Apr 26, 2026 11:084,79029,372,3327,984,0003,992,0002,543,616
9Apr 26, 2026 11:084,89227,954,15010,193,0002,038,0002,543,616