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 25, 2022 14:29Yuriy LyfenkoYuriy LyfenkoScore: 17,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2022 14:2917,357207,530,891144,060,91902,265,088
2Jul 25, 2022 14:2917,376204,273,689144,218,30802,256,896
3Jul 25, 2022 14:2917,753171,667,927144,346,0003,007,0002,387,968
4Jul 25, 2022 14:2917,758211,745,796147,392,64402,256,896
5Jul 25, 2022 14:2917,760171,945,666145,405,0002,005,0002,424,832
6Jul 25, 2022 14:2917,772175,872,853145,500,0002,006,0002,469,888
7Jul 25, 2022 14:2917,775170,666,332145,543,0001,993,0002,412,544
8Jul 25, 2022 14:2917,777176,295,174146,546,0001,003,0002,359,296
9Jul 25, 2022 14:2917,801172,675,232145,752,0001,996,0002,441,216
10Jul 25, 2022 14:2917,828175,350,653145,976,0001,999,0002,379,776
11Jul 25, 2022 14:2917,924173,241,736147,775,000998,0002,404,352
12Jul 25, 2022 14:2918,208173,926,117149,123,0002,001,0002,260,992