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 listSep 3, 2026 06:25CheckHarryCheckHarryScore: 4,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 06:254,72849,037,58938,221,0001,025,0002,113,536
2Sep 3, 2026 06:254,73649,174,22938,288,0001,026,0002,113,536
3Sep 3, 2026 06:254,74649,256,88638,369,0001,026,0002,113,536
4Sep 3, 2026 06:254,84149,993,51938,176,0002,005,0002,113,536
5Sep 3, 2026 06:254,85750,126,11339,296,0001,025,0002,113,536
6Sep 3, 2026 06:254,86759,030,40338,373,0002,025,0002,113,536
7Sep 3, 2026 06:254,88850,393,39539,551,0001,025,0002,113,536
8Sep 3, 2026 06:254,89550,457,46338,626,0002,005,0002,113,536
9Sep 3, 2026 06:254,90652,375,13638,613,0002,108,0002,113,536