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:29Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:22Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:23042,753,32433,501,0001,099,0002,117,632expected "74600294196621100 ", got "16881282700717868 "
2Jul 7, 2026 01:23042,395,04533,405,0001,120,0002,117,632expected "74600294196621100 ", got "16881282700717868 "
3Jul 7, 2026 01:23042,478,41633,386,0001,143,0002,117,632expected "74600294196621100 ", got "15157030540717868 "
4Apr 13, 2026 18:294,34964,360,32134,092,0002,005,0002,535,424
5Apr 13, 2026 18:294,38458,356,44834,363,0002,021,0002,469,888
6Apr 13, 2026 18:294,38564,380,37034,374,0002,022,0002,535,424