Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listApr 13, 2026 18:32Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 00:10Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 00:10042,176,77132,963,0001,134,0002,117,632expected "74600294196621100 ", got "15000399500717868 "
2Jul 7, 2026 00:10042,372,69833,353,0001,134,0002,117,632expected "74600294196621100 ", got "15157030540717868 "
3Jul 7, 2026 00:10042,184,44933,206,0001,123,0002,117,632expected "74600294196621100 ", got "15149231756717868 "
4Apr 13, 2026 18:324,33163,767,02033,952,0001,997,0002,482,176
5Apr 13, 2026 18:324,34064,697,93834,022,0002,001,0002,535,424
6Apr 13, 2026 18:324,34260,810,82534,038,0002,002,0002,478,080