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 9, 2021 15:24Andrey TsvetkovAndrey TsvetkovScore: 32,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2022 07:2932,870336,235,928272,822,30702,240,512
2Sep 9, 2021 15:2432,875335,011,250272,865,48602,244,608
3Sep 9, 2021 15:2432,877342,424,978272,878,75302,248,704
4Sep 9, 2021 15:2432,879333,564,583272,893,85302,244,608
5Jan 17, 2022 07:3132,880331,661,956272,902,75302,232,320
6Sep 9, 2021 15:2432,884329,299,868272,936,79902,252,800
7Jan 17, 2022 07:3132,887342,272,578272,961,77802,248,704
8Jan 17, 2022 07:2932,888332,056,884272,972,05802,244,608
9Sep 9, 2021 15:2432,890333,444,447272,984,60902,248,704
10Jan 17, 2022 07:2932,908346,885,561273,134,98002,252,800
11Jan 17, 2022 07:3132,910328,267,978273,153,78602,248,704
12Sep 9, 2021 15:2432,916332,032,960273,201,25102,240,512