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 listJun 12, 2021 04:08evgenikwtevgenikwtScore: 28,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 04:0828,408264,496,486234,786,000999,0002,260,992
2Jun 12, 2021 04:0828,425260,586,965233,927,0001,999,0002,383,872
3Jun 12, 2021 04:0828,427261,763,173234,944,000999,0002,256,896
4Jun 12, 2021 04:0828,462264,338,794235,233,0001,000,0002,523,136
5Jun 12, 2021 04:0828,478260,991,050235,367,0001,001,0002,260,992
6Jun 12, 2021 04:0828,486265,382,569236,434,00002,260,992
7Jun 12, 2021 04:0828,493261,936,009236,490,00002,260,992
8Jun 12, 2021 04:0828,521261,385,765234,725,0001,997,0002,519,040
9Jun 12, 2021 04:0828,551260,958,971234,978,0001,999,0002,383,872
10Jun 12, 2021 04:0829,464297,069,463244,552,82902,265,088
11Jun 12, 2021 04:0829,482308,372,869244,696,48002,256,896
12Jun 12, 2021 04:0829,493305,756,211244,787,76002,265,088