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 listJan 1, 2026 21:25Josu San MartinJosu San MartinScore: 11,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 21:2511,23458,684,14521,064,0007,021,0002,445,312
2Jan 1, 2026 21:2511,24056,499,29323,083,0005,018,0002,486,272
3Jan 1, 2026 21:2511,26253,724,44021,117,0007,039,0002,482,176