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 4, 2026 19:55olliecrowolliecrowScore: 14,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 19:5514,08761,487,62229,180,0006,037,0002,400,256
2Mar 4, 2026 19:5514,10860,722,49330,231,0005,038,0002,347,008
3Mar 4, 2026 19:5514,15961,143,89228,318,0007,079,0002,387,968