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 13, 2021 21:18evgenikwtevgenikwtScore: 28,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 21:1828,075257,123,143232,020,0001,000,0002,379,776
2Jun 13, 2021 21:1828,108256,581,439233,298,00002,265,088
3Jun 13, 2021 21:1828,155264,924,025232,686,000998,0002,260,992
4Jun 13, 2021 21:1828,161260,201,881231,743,0001,997,0002,371,584
5Jun 13, 2021 21:1828,164267,344,446231,767,0001,997,0002,375,680
6Jun 13, 2021 21:1828,176260,993,151231,860,0001,998,0002,260,992
7Jun 13, 2021 21:1828,184262,629,832232,932,000999,0002,260,992
8Jun 13, 2021 21:1828,190263,188,339232,982,000999,0002,260,992
9Jun 13, 2021 21:1828,197259,826,734232,039,0002,000,0002,519,040
10Jun 13, 2021 21:1828,685297,471,523238,088,36902,260,992
11Jun 13, 2021 21:1828,698294,910,446238,194,28202,244,608
12Jun 13, 2021 21:1828,701291,128,249238,216,70602,248,704