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 01:47olliecrowolliecrowScore: 4,829Success
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 01:474,66631,499,85510,606,0001,060,0002,527,232
2Apr 17, 2026 01:474,82929,168,87010,060,0002,012,0002,437,120
3Apr 17, 2026 01:475,10637,253,50610,637,0002,127,0002,318,336