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 5, 2021 12:15Andrey TsvetkovAndrey TsvetkovScore: 69,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2021 12:1569,470630,068,277576,601,35902,244,608
2Sep 5, 2021 12:1569,488637,521,196576,751,27702,244,608
3Sep 5, 2021 12:1569,518631,620,354576,996,54802,244,608
4Sep 5, 2021 12:1569,519630,099,057577,004,94302,240,512
5Sep 5, 2021 12:1569,578643,002,999577,496,87502,240,512
6Sep 5, 2021 12:1571,699653,995,707595,099,71302,240,512