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 12, 2026 03:09olliecrowolliecrowScore: 9,164Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 03:099,16051,902,34117,922,0004,978,0002,347,008
2Mar 12, 2026 03:099,16446,821,84618,927,0003,984,0002,334,720
3Mar 12, 2026 03:099,24249,048,75018,083,0005,023,0002,318,336