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 26, 2025 19:23sheryllynn24sheryllynn24Score: 6,485Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 19:236,36283,734,52750,809,0001,992,0002,285,568
2Sep 26, 2025 19:236,36283,021,67350,809,0001,992,0002,285,568
3Sep 26, 2025 19:236,36378,114,55151,820,000996,0002,285,568
4Sep 26, 2025 19:236,48578,761,61851,830,0001,993,0002,265,088
5Sep 26, 2025 19:236,49388,079,62451,893,0001,995,0002,519,040
6Sep 26, 2025 19:236,49585,495,51851,914,0001,996,0002,269,184