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 27, 2026 18:20Charles CabergsCharles CabergsScore: 7,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 18:206,77639,921,30611,958,0004,982,0002,441,216
2Apr 27, 2026 18:206,78136,356,43512,715,0004,238,0002,457,600
3Apr 27, 2026 18:206,79632,956,49513,992,0002,998,0002,449,408
4Apr 27, 2026 18:207,01037,654,75811,340,0006,185,0002,445,312
5Apr 27, 2026 18:207,05135,563,44914,323,0003,305,0002,453,504
6Apr 27, 2026 18:207,06840,561,26610,395,0007,277,0002,453,504
7Apr 27, 2026 18:207,08939,948,75713,553,0004,170,0002,457,600
8Apr 27, 2026 18:207,11434,075,3199,881,0007,904,0002,449,408
9Apr 27, 2026 18:207,42832,697,15813,413,0005,158,0002,449,408