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 listAug 17, 2025 07:34Ashish AhujaAshish AhujaScore: 14,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2025 07:3414,867146,236,469108,470,00014,927,0002,301,952
2Aug 17, 2025 07:3414,964148,625,747114,187,00010,016,0002,310,144
3Aug 17, 2025 07:3415,326155,457,040114,183,00013,020,0002,330,624