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 12:06Andrey TsvetkovAndrey TsvetkovScore: 33,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2021 12:0233,036331,524,501274,199,74202,293,760
2Sep 9, 2021 12:0633,036337,771,869274,201,36902,289,664
3Sep 9, 2021 12:0433,037348,885,476274,206,14202,297,856
4Sep 9, 2021 12:0433,046327,759,352274,285,71302,297,856
5Sep 9, 2021 12:0233,049333,018,724274,305,01002,293,760
6Sep 9, 2021 12:0433,052338,030,643274,333,20902,293,760
7Sep 9, 2021 12:0633,055337,711,544274,356,75202,174,976
8Sep 9, 2021 12:0633,059330,596,281274,390,40102,301,952
9Sep 9, 2021 12:0233,061336,587,754274,410,01102,289,664