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:12olliecrowolliecrowScore: 16,237Success
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:1216,17264,768,81435,376,0005,053,0002,400,256
2Mar 4, 2026 19:1216,17765,099,17234,377,0006,066,0002,387,968
3Mar 4, 2026 19:1216,20861,275,64736,468,0004,052,0002,408,448
4Mar 4, 2026 19:1216,23063,194,51738,548,0002,028,0002,400,256
5Mar 4, 2026 19:1216,23768,378,06735,519,0005,074,0002,387,968
6Mar 4, 2026 19:1216,24267,098,45435,530,0005,075,0002,408,448
7Mar 4, 2026 19:1216,26865,848,47534,571,0006,100,0002,289,664
8Mar 4, 2026 19:1216,29367,012,13536,660,0004,073,0002,400,256
9Mar 4, 2026 19:1216,35273,937,48135,894,0004,985,0002,400,256