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 listJul 19, 2022 21:53Yuriy LyfenkoYuriy LyfenkoScore: 18,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2022 21:5318,283176,735,235150,753,000998,0002,387,968
2Jul 19, 2022 21:5318,307178,276,684148,946,0002,998,0002,412,544
3Jul 19, 2022 21:5318,312175,064,935150,987,000999,0002,478,080
4Jul 19, 2022 21:5318,346217,460,294152,274,87902,224,128
5Jul 19, 2022 21:5318,388216,567,122152,617,40202,240,512
6Jul 19, 2022 21:5318,393211,560,586152,662,21402,199,552
7Jul 19, 2022 21:5318,493176,037,653152,488,0001,003,0002,379,776
8Jul 19, 2022 21:5318,533181,269,675151,824,0001,997,0002,342,912
9Jul 19, 2022 21:5318,567179,299,186150,102,0004,002,0002,338,816
10Jul 19, 2022 21:5318,861183,734,994154,538,0002,006,0002,375,680
11Jul 19, 2022 21:5318,889183,789,000155,777,000998,0002,260,992
12Jul 19, 2022 21:5318,947180,342,256154,259,0003,005,0002,396,160