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 03:44CheckHarryCheckHarryScore: 5,825Success
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 03:455,81658,164,66747,239,0001,037,0002,113,536
2Sep 3, 2026 03:455,81858,182,87447,257,0001,040,0002,113,536
3Sep 3, 2026 03:455,81958,157,57747,135,0001,166,0002,113,536
4Sep 3, 2026 03:455,82258,139,58747,277,0001,046,0002,113,536
5Sep 3, 2026 03:455,82558,197,36047,301,0001,048,0002,113,536
6Sep 3, 2026 03:455,82858,258,38447,328,0001,052,0002,113,536
7Sep 3, 2026 03:455,82858,245,53647,326,0001,051,0002,113,536
8Sep 3, 2026 03:455,82958,258,05747,328,0001,058,0002,113,536
9Sep 3, 2026 03:455,83058,269,29147,345,0001,052,0002,113,536