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 listNov 8, 2026 07:35highload-churnerhighload-churnerScore: 1,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 07:361,13811,915,0221,820,0001,025,000524,288
2Nov 8, 2026 07:361,14011,854,4871,829,0001,023,000524,288
3Nov 8, 2026 07:361,17311,997,2861,892,0001,041,000524,288
4Nov 8, 2026 07:361,18312,000,1981,922,0001,037,000524,288
5Nov 8, 2026 07:361,21912,158,3121,894,0001,154,000524,288
6Nov 8, 2026 07:361,29012,740,8081,784,0001,441,000524,288
7Nov 8, 2026 07:361,29412,310,5812,180,0001,056,000524,288
8Nov 8, 2026 07:361,29412,288,4152,188,0001,048,000524,288
9Nov 8, 2026 07:361,32612,452,1102,017,0001,300,000524,288