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 listMay 13, 2024 10:42richu shaji abrahamrichu shaji abrahamScore: 98,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2024 10:4298,689890,260,335819,118,65102,314,240
2May 13, 2024 10:4598,696882,015,412819,174,05702,191,360
3May 13, 2024 10:4598,833878,486,403820,316,09202,318,336
4May 13, 2024 10:4298,894880,197,705820,823,08202,256,896
5May 13, 2024 10:4599,038881,179,177822,016,95902,187,264
6May 13, 2024 10:4299,865889,987,117828,878,02002,269,184