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 15, 2025 18:31Aleksei ShahoikaAleksei ShahoikaScore: 28,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2025 18:3128,421266,060,546233,895,0001,999,0002,285,568
2Sep 15, 2025 18:3128,424264,101,760233,920,0001,999,0002,285,568
3Sep 15, 2025 18:3128,432261,065,300233,986,0001,999,0002,285,568
4Sep 15, 2025 18:3128,462256,754,159235,232,0001,000,0002,359,296
5Sep 15, 2025 18:3128,486263,852,961235,431,0001,001,0002,285,568
6Sep 15, 2025 18:3128,497264,624,524235,519,0001,002,0002,285,568
7Sep 15, 2025 18:3128,543260,872,093235,904,000999,0002,265,088
8Sep 15, 2025 18:3128,596259,854,845236,343,0001,001,0002,260,992
9Sep 15, 2025 18:3128,633266,862,763235,659,0001,997,0002,510,848